LeetCode|Binary Tree Right Side View

最新推荐文章于 2020-03-05 16:48:16 发布

DouMiaoO_Oo

最新推荐文章于 2020-03-05 16:48:16 发布

阅读量358

点赞数

分类专栏： LeetCode 文章标签： leetcode BFS 层次遍历

本文链接：https://blog.csdn.net/DouMiaoO_Oo/article/details/51472033

版权

LeetCode 专栏收录该内容

73 篇文章 0 订阅

订阅专栏

Binary Tree Right Side View

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].
思路：BFS，树的层次遍历改为先右子树再左子树

/**
 * 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 == NULL) return res;
        queue<pair<TreeNode*, int> > q;
        q.push(pair<TreeNode*, int>(root, 0));
        int lastLevel = -1;
        while(!q.empty()){
            pair<TreeNode*, int> p = q.front();
            q.pop();
            if(lastLevel != p.second) {
                res.push_back(p.first->val);
            } lastLevel = p.second;
            if(p.first->right != NULL) q.push(pair<TreeNode*, int>(p.first->right, p.second+1));
            if(p.first->left != NULL) q.push(pair<TreeNode*, int>(p.first->left, p.second+1));
        } return res;
    }
};