LeetCode 199.二叉树的右视图

给定一棵二叉树，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。

​ 示例:

输入: [1,2,3,null,5,null,4]
输出: [1, 3, 4]
解释:

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

深度优先搜索

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Integer> list = new ArrayList<>();
    int dep = 0;
    public List<Integer> rightSideView(TreeNode root) {
        DFS(root, 0);
        return list;
    }

    public void DFS(TreeNode root, int high) {
        if (root == null) {
            return;
        }
        if (high == dep) {
            list.add(root.val);
            dep++;
        }
        DFS(root.right, high + 1);
        DFS(root.left, high + 1);
    }
}

广度优先搜索

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<Integer> list = new ArrayList<>();
    public List<Integer> rightSideView(TreeNode root) {
        BFS(root);
        return list;
    }

    public void BFS(TreeNode root) {
        if(root == null){
            return;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode elem = queue.poll();
                if (elem.left != null) {
                    queue.offer(elem.left);
                }
                if (elem.right != null) {
                    queue.offer(elem.right);
                }
                if (i == size - 1) {
                    list.add(elem.val);
                }
            }
        }
    }
}