LeetCode 199. Binary Tree Right Side View

最新推荐文章于 2024-09-07 11:55:59 发布

ActiveCoder

最新推荐文章于 2024-09-07 11:55:59 发布

阅读量275

点赞数

分类专栏： LeetCode 题解

本文链接：https://blog.csdn.net/github_34333284/article/details/51166917

版权

LeetCode 题解专栏收录该内容

288 篇文章 0 订阅

订阅专栏

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

Nothing Special....

 vector<int> rightSideView(TreeNode* root) {
        if(!root) return {};
        vector<TreeNode*> nodes;
        nodes.push_back(root);
        vector<int> res;
        while(!nodes.empty()) {
            vector<TreeNode*> nextLevel;
            res.push_back(nodes[0]->val);
            for(int i = 0; i < nodes.size(); ++i) {
                if(nodes[i]->right) nextLevel.push_back(nodes[i]->right);
                if(nodes[i]->left) nextLevel.push_back(nodes[i]->left);
            }
            nodes.swap(nextLevel);
        }
        return res;
    }