[Leetcode] 199. Binary Tree Right Side View

Problems: https://leetcode.com/problems/binary-tree-right-side-view/

Solution1:
level order，将每层分好后取出最右的值

class Solution {
    List<ArrayList<Integer>> levels = new ArrayList<>();
    
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList<>();
        if(root == null) {
            return result;
        }
        
        helper(root, 0);
        
        for(ArrayList<Integer> list : levels) {
            result.add(list.get(list.size() - 1));
        }
        return result;
    }
    // level order
    public void helper(TreeNode node, int level) {
        if(levels.size() == level) {
            levels.add(new ArrayList<Integer>());
        }
        levels.get(level).add(node.val);
        if(node.left != null) {
            helper(node.left, level+1);
        }
        if(node.right != null) {
            helper(node.right, level+1);
        }
    }
}

Solution2:
使用queue

class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        ArrayList<Integer> ans = new ArrayList<>();
        if(root == null) {
            return ans;
        }
        
        List<ArrayList<Integer>> lists = new ArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        
        while(!queue.isEmpty()) {
            ArrayList<Integer> list = new ArrayList<>();
            int size = queue.size();
            for(int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                list.add(node.val);
                if(node.left != null) {
                    queue.add(node.left);
                }
                if(node.right != null) {
                    queue.add(node.right);
                }
            }
            lists.add(list);
        }
        
        
        for(ArrayList<Integer> list : lists) {
            ans.add(list.get(list.size()-1));
        }
        return ans;
    }
}