LeetCode 199. Binary Tree Right Side View

最新推荐文章于 2023-11-07 09:51:46 发布

Lonvon_

最新推荐文章于 2023-11-07 09:51:46 发布

阅读量209

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/Lonvon_/article/details/52653572

版权

LeetCode 专栏收录该内容

18 篇文章 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].

分析：对一颗二叉树进行层次遍历，每一层最后一个访问到的结点就是站在右侧看到的结点。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
#include <queue>
using namespace std;

class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
         vector<int> res;
         if (root == NULL) return res;
         TreeNode* cur;
         queue<TreeNode*> q;
         q.push(root);
         while (!q.empty()) {
             int size = q.size();
             while (size > 1) {
                 cur = q.front();
                 if (cur->left != NULL) q.push(cur->left);
                 if (cur->right != NULL) q.push(cur->right);
                 q.pop();
                 size--;
             }
             cur = q.front();
             if (cur->left != NULL) q.push(cur->left);
             if (cur->right != NULL) q.push(cur->right);
             res.push_back(cur->val);
             q.pop();
         }
         return res;
    }
};