199. Binary Tree Right Side View

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

For example:
Given the following binary tree,

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

You should return [1, 3, 4].

复杂度：
时间 O(b^(h+1)-1) 空间 O(h) 递归栈空间 对于二叉树b=2

思路：
深度优先搜索，本题实际上是求二叉树每一层的最后一个节点，我们用DFS先遍历右子树并记录遍历的深度，如果这个右子节点的深度大于当前所记录的最大深度，说明它是下一层的最右节点（因为我们先遍历右边，所以每一层都是先从最右边进入），将其加入结果中。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    int maxdepth = 0;
    List<Integer> res;
    
    public List<Integer> rightSideView(TreeNode root) {
        res = new LinkedList<Integer>();
        if(root != null) helper(root,1);
        return res;
    }
    
    private void helper(TreeNode root, int depth){
        if(depth > maxdepth){
            maxdepth = depth;
            res.add(root.val);
        }
        if(root.right != null) helper(root.right, depth + 1);
        if(root.left != null) helper(root.left, depth + 1);
    }
}

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        if(root == null) return Collections.emptyList();
        List<Integer> result = new ArrayList();
        Queue<TreeNode> queue = new LinkedList();
        queue.add(root);
        //int level = 0;
        while(!queue.isEmpty()){
            int size = queue.size();
            for(int i=0;i<size;i++){
                TreeNode node = queue.poll();
                if(i == size-1) result.add(node.val);
                if(node.left != null) queue.add(node.left);
                if(node.right != null) queue.add(node.right);
            }
        }
        return result;
    }
}