binary tree right view

/**
 * 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> list = new ArrayList<>();
        // if(root == null) return list;
        // Queue<TreeNode> queue = new LinkedList<>();
        // queue.offer(root);
        // int start = 0,end= 1,count = 0;
        // while(!queue.isEmpty()){
        //     TreeNode temp = queue.poll();
        //     if(temp.left != null){
        //         queue.offer(temp.left);
        //     }
        //     if(temp.right != null){
        //         queue.offer(temp.right);
        //     }
        //     start++;
        //     if(start == end){
        //         list.add(temp.val);
        //         start = 0;
        //         end = queue.size();
        //     }
        // }
        // return list;
        
        List<Integer> list = new ArrayList<>();
        
        rightView(list,root,0);
        return list;
        
    }
    
    void rightView(List<Integer> list,TreeNode root,int depth){
        if(root == null) return;
        if(list.size() == depth){
            list.add(root.val);
        }
        rightView(list,root.right,depth+1);
        rightView(list,root.left,depth+1);
    }
    
    
    
    
    
    
}