二叉树的右视图

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

解析：

按照层次遍历的思想去解题。

代码：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> rightSideView(TreeNode root) {
     
       List<Integer> view=new ArrayList<>();
       Queue<TreeNode> queue1 = new LinkedList<TreeNode>();  //
       Queue<Integer> queue2 = new LinkedList<Integer>();
  
       if(root!=null){
           queue1.offer(root);
           queue2.offer(0);
       }

       while(!queue1.isEmpty()){
            TreeNode node = queue1.peek();
            Integer depth=queue2.peek();
            queue1.poll();queue2.poll();
            if(view.size()==depth){
                view.add(node.val);
            }else{
                view.set(depth,node.val);
            }
            if(node.left!=null){
                queue1.offer(node.left);
                queue2.offer(depth+1);
            }
            if(node.right!=null){
                queue1.offer(node.right);
                queue2.offer(depth+1);
            }
       }
      return view;
    }
}