題目199. Binary Tree Right Side View

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

 分析:就是找到每層最右邊的節(jié)點

1,深搜

思路: 深搜,一個集合中存放訪問到的每層節(jié)點,在搜索的過程中,更新對應(yīng)層的最右邊節(jié)點

 public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList<Integer>();
        dfs(root,result,0);
        return result;
     }
     
     private void dfs(TreeNode root, List<Integer> result, int level){
         if(root == null){
             return;
         }
         if(result.size() == level){
             result.add(level,root.val);
         }else{
             result.set(level,root.val); 
         }
         
         dfs(root.left,result,level+1);
         dfs(root.right,result,level+1);
     }

2,利用層次遍歷

思路:利用層次遍歷, 然后每層遍歷結(jié)束后,取最右邊的節(jié)點

 public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList<Integer>();
        if(root == null){
            return result;
        }
        
        Stack<TreeNode> curLevelNodes = new Stack<TreeNode>();
        curLevelNodes.push(root);
        while(!curLevelNodes.empty()){
            TreeNode rightNode = curLevelNodes.peek();
            result.add(rightNode.val);
            Stack<TreeNode> nextLevelNodes = new Stack<TreeNode>();
            for(TreeNode node : curLevelNodes){
                if(node.left != null){
                    nextLevelNodes.add(node.left);
                }
                if(node.right != null){
                    nextLevelNodes.add(node.right);
                }
            }
          curLevelNodes = nextLevelNodes;
        }
        return result;
    }