199. Binary Tree Right Side View

最新推荐文章于 2021-07-22 10:41:08 发布

BigFatSheep

最新推荐文章于 2021-07-22 10:41:08 发布

阅读量115

点赞数

分类专栏： Leetcode Medium

本文链接：https://blog.csdn.net/BigFatSheep/article/details/83282996

版权

Leetcode 同时被 2 个专栏收录

385 篇文章 0 订阅

订阅专栏

Medium

195 篇文章 0 订阅

订阅专栏

Description

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.

Example:

Input: [1,2,3,null,5,null,4]
Output: [1, 3, 4]
Explanation:

1 <—
/
2 3 <—
\
5 4 <—

Problem URL

Solution

给一棵二叉树，返回这棵二叉树从右边看的从root到leaf的值。

We use an int depth to document the depth of we have travered. If depth is equal to size of res. We add the node’s value into res. It is kind like post order traversal. node->right-left order.

Code

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> res = new ArrayList<>();
        rightViewHelper(res, root, 0);
        return res;
    }
    
    private void rightViewHelper(List<Integer> res, TreeNode node, int depth){
        if (node == null){
            return;
        }
        if (depth == res.size()){
            res.add(node.val);
        }
        rightViewHelper(res, node.right, depth + 1);
        rightViewHelper(res, node.left, depth + 1);
    }
}