自己想了這個(gè)方法，有可能不是特別efficient.
一個(gè)queue放普通的BFS。
一個(gè)queue放level。
同時(shí)維護(hù)一個(gè)parent value；維護(hù)一個(gè)跟著BFS跑的level。
每個(gè)node都有一個(gè)lv。一旦lv和正在跑的level不一樣，證明lv>level，那么也就是說，剛剛換行拉。parent的值，就是上一行最右邊的值。DONE.

/*
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].

Tags: Tree, Depth-first Search, Breadth-first Search
Similar Problems: (M) Populating Next Right Pointers in Each Node

*/

/*
Thoughts:
Use 2 queue: one for BFS, one for level. Each node in queue has a corresponding level
Track level.
WHen level != levelQ.poll(), that means we are moving to next level, and we should record the previous(parent) node's value.
*/

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> rst = new ArrayList<Integer>();
        if (root == null) {
            return rst;
        }   
        Queue<TreeNode> q = new LinkedList<TreeNode>();
        Queue<Integer> levelQ = new LinkedList<Integer>();
        q.offer(root);
        levelQ.offer(1);
        int level = 1;
        int parent = root.val;
        TreeNode node = null;
        
        while (!q.isEmpty()) {
            node = q.poll();
            int lv = levelQ.poll();
            if (level != lv) {
                level++;
                rst.add(parent);
            }
            parent = node.val;
            if (node.left != null) {
                q.offer(node.left);
                levelQ.offer(lv + 1);
            } 
            if (node.right != null) {
                q.offer(node.right);
                levelQ.offer(lv + 1);
            }
        }//END while
        rst.add(parent);
        return rst;
    }
}