LeetCode: 199. Binary Tree Right Side View

最新推荐文章于 2023-05-04 14:01:14 发布

杨领well

最新推荐文章于 2023-05-04 14:01:14 发布

阅读量133

点赞数

分类专栏： LeetCode 杨领well的 LeetCode 题解专栏

本文链接：https://blog.csdn.net/yanglingwell/article/details/82250574

版权

LeetCode 同时被 2 个专栏收录

250 篇文章 0 订阅

订阅专栏

杨领well的 LeetCode 题解专栏

241 篇文章 5 订阅

订阅专栏

LeetCode: 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.

Example:

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

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

解题思路 —— 递归分治

前序遍历二叉树节点，当某一层出现新的节点后，替换掉当前在该层保存的节点。

AC 代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
     void rightSideView(TreeNode* root, vector<int>& record, int depth = 0)
     {
         if(root == nullptr) return;

         if(depth >= record.size()) record.push_back(root->val);
         else record[depth] = root->val;

         rightSideView(root->left, record, depth+1);
         rightSideView(root->right, record, depth+1);
     }
public:
    vector<int> rightSideView(TreeNode* root) {
        vector<int> ans;
        rightSideView(root, ans);

        return ans;
    }
};