[LeetCode 199] Binary Tree Right Side View

最新推荐文章于 2024-01-19 11:16:08 发布

原创最新推荐文章于 2024-01-19 11:16:08 发布 · 267 阅读

0 ·

CC 4.0 BY-SA版权

c/c++ 同时被 2 个专栏收录

110 篇文章

订阅专栏

LeetCode

90 篇文章

订阅专栏

本文介绍如何通过广度优先搜索算法获取给定二叉树的右视图节点值，具体实现了一个名为 Solution 的类，其中包含 rightSideView 函数用于解决此问题。

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) {}
 * };
 */
class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        queue<TreeNode*> s;
        vector<int> v;
        if(root==NULL)
            return v;
        s.push(root);
        while(!s.empty())
        {
            int len=s.size();
            TreeNode* node;
            for(int i=0;i<len;i++)
            {
                node=s.front();
                s.pop();
                if(node->left!=NULL)
                    s.push(node->left);
                if(node->right!=NULL)
                    s.push(node->right);
            }
            v.push_back(node->val);
        }
        return v;
    }
};