Binary Tree Right Side View

 1     public List<Integer> rightSideView(TreeNode root) {
 2                 List<Integer> res = new ArrayList<Integer>(); // save the result to this variable
 3         if (root == null) return res;
 4         
 5         LinkedList<TreeNode> queue = new LinkedList<TreeNode>();  
 6         queue.add(root);  
 7         int curLevCnt = 1;  
 8         int nextLevCnt = 0;  
 9         int levelres = 0;  
10         
11         while(!queue.isEmpty()){  
12             TreeNode cur = queue.poll();  
13             curLevCnt--;  
14             //levelres.add(cur.val);  
15             
16             if(cur.left != null){  
17                 queue.add(cur.left);  
18                 nextLevCnt++;  
19             }  
20             if(cur.right != null){  
21                 queue.add(cur.right);  
22                 nextLevCnt++;  
23             }  
24               
25             if(curLevCnt == 0){  
26                 curLevCnt = nextLevCnt;  
27                 nextLevCnt = 0;  
28                 levelres = cur.val;
29                 res.add(cur.val);  
30                 //levelres =new int;  
31             }  
32         }  
33         return res;  
34     
35     }