LeetCode(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].

解题思路:
第一种是用队列，层次遍历二叉树，遍历到每层的最后一个元素，加入result中，返回结果。第二种是用递归，用level保存当前最大层数，从右往左依次遍历二叉树，直到当前层数大于level，加入result中，如果左子树或右子树不为空，继续遍历。下面附上两种解法:

public class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList<Integer>();
        LinkedList<TreeNode> rows = new LinkedList<TreeNode>();
        if(root == null)
            return result;
        rows.add(root);
        while(rows.size() != 0){
            int size = rows.size();
            for(int i = 0; i < size; i++){
                TreeNode temp = rows.remove();
                if(temp.left != null)
                    rows.add(temp.left);
                if(temp.right != null)
                    rows.add(temp.right);
                if(i == size-1){
                    result.add(temp.val);
                }
            }
        }
        return result;
    }
}

public class Solution {
    int level;
    List<Integer> result;
    public List<Integer> rightSideView(TreeNode root) {
        result = new ArrayList<Integer>();
        addNode(root,1);
        return result;
    }
    public void addNode(TreeNode root,int n){
        if(root == null)
            return;
        if(n > level){
            result.add(root.val);
            level++;
        }
        n++;
        addNode(root.right,n);
        addNode(root.left,n);
    }
}