Binary Tree Right Side View

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

转载最新推荐文章于 2024-01-19 11:16:08 发布 · 330 阅读

leetcode 专栏收录该内容

105 篇文章

订阅专栏

本文介绍了一种使用广度优先搜索算法来获取二叉树的右侧视图的方法。通过队列保存每一层的最后一个节点，实现了对二叉树右侧节点值的收集。

/**
 * 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) 
    {
        vector<int> res;
        if (!root)
            return res;
        queue<TreeNode*> q;
        q.push(root);
        TreeNode* cur = NULL;
        while(!q.empty())
        {
            int size = q.size();
            for(int i = 0; i < size; ++i)
            {
                cur = q.front();
                q.pop();
                if (cur->left)
                    q.push(cur->left);
                if (cur->right)
                    q.push(cur->right);
            }
            res.push_back(cur->val);
        }
        
        return res;
        
    }
};