Binary Tree Right Side View

1. Title

Binary Tree Right Side View

2. Http address

https://leetcode.com/problems/binary-tree-right-side-view/

3. The question

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

4. My code(AC)

    
    public static void getRightSide(TreeNode root, List<Integer> res,  boolean depth[],int de){
        
        if( root == null)
            return;
        if( root.right != null)
        {
            if( depth[de] == false)
            {
                res.add(root.right.val);
                depth[de] = true;
            }
            getRightSide(root.right, res, depth, de +1);
        }else{
            if( root.left != null && depth[de] == false)
            {
                res.add(root.left.val);
                depth[de] = true;
            }
        }
        
        getRightSide(root.left, res, depth, de +1);
    }
    // Accepted
       public static List<Integer> rightSideView(TreeNode root) {
           
           List<Integer> res = new ArrayList<Integer>(); 
           boolean depth[] = new  boolean[256];
           if ( root == null)
               return res;
           res.add(root.val);
           getRightSide(root, res,depth, 1);
           return res;
       }