Leetcode162: Binary Tree Right Side View

最新推荐文章于 2024-09-18 11:04:20 发布

银色子弹lx

最新推荐文章于 2024-09-18 11:04:20 发布

阅读量252

点赞数

分类专栏： leetcode c++ 文章标签： leetcode algorithm

本文链接：https://blog.csdn.net/u013089961/article/details/49906719

版权

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

244 篇文章 0 订阅

订阅专栏

leetcode

243 篇文章 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) {}
 * };
 */
class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        vector<int> res;
        if(!root)
            return res;
        queue<TreeNode*> q1;
        q1.push(root);
        vector<int> temp;
        while(!q1.empty())
        {
            queue<TreeNode*> q2;
            temp.clear();
            while(!q1.empty())
            {
                TreeNode* node = q1.front();
                q1.pop();
                temp.push_back(node->val);
                if(node->left)
                {
                    q2.push(node->left);
                } 
                if(node->right)
                {
                    q2.push(node->right);
                }
            }
            q1 = q2;
            res.push_back(temp[temp.size()-1]);
        }
        return res;
    }
};

改进：

/**
 * 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*> q1;
        q1.push(root);
        TreeNode* node;
        while(!q1.empty())
        {
            queue<TreeNode*> q2;
            while(!q1.empty())
            {
                node = q1.front();
                q1.pop();
                if(node->left)
                {
                    q2.push(node->left);
                } 
                if(node->right)
                {
                    q2.push(node->right);
                }
            }
            q1 = q2;
            res.push_back(node->val);
        }
        return res;
    }
};