[leetcode]binary-tree-right-side-view 二叉树右视图

xiaocong1990

已于 2024-06-25 17:11:55 修改

阅读量104

点赞数 2

分类专栏： leetcode 树文章标签： leetcode 算法职场和发展

于 2024-06-21 10:05:47 首次发布

本文链接：https://blog.csdn.net/xiaocong1990/article/details/139853473

版权

leetcode 同时被 2 个专栏收录

473 篇文章 2 订阅

订阅专栏

树

60 篇文章 0 订阅

订阅专栏

. - 力扣（LeetCode）

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {

        vector<int> rightView;
        if(!root)
            return rightView;
        queue<TreeNode*> nodeQueue;
        nodeQueue.push(root);


        while (!nodeQueue.empty()) {
            

            int size =  nodeQueue.size();
            for (int i = 0; i < size; ++i) {
                TreeNode* node = nodeQueue.front();
                nodeQueue.pop();

                if (i == size - 1) {
                    rightView.push_back(node -> val);
                }
                
                if(node->left) nodeQueue.push(node -> left);
                if(node->right) nodeQueue.push(node -> right);
                   
                
            }
        }


        return rightView;
    }
};

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        unordered_map<int, int> rightmostValueAtDepth;
        int max_depth = -1;

        queue<TreeNode*> nodeQueue;
        queue<int> depthQueue;
        nodeQueue.push(root);
        depthQueue.push(0);

        while (!nodeQueue.empty()) {
            

            int size =  nodeQueue.size();
            for (int i = 0; i < size; ++i) {
                TreeNode* node = nodeQueue.front();nodeQueue.pop();
                int depth = depthQueue.front();depthQueue.pop();

                
                if (node != NULL) {
                    // 维护二叉树的最大深度
                    max_depth = max(max_depth, depth);

                    // 由于每一层最后一个访问到的节点才是我们要的答案，因此不断更新对应深度的信息即可
                    rightmostValueAtDepth[depth] =  node -> val;

                    nodeQueue.push(node -> left);
                    nodeQueue.push(node -> right);
                    depthQueue.push(depth + 1);
                    depthQueue.push(depth + 1);
                }
            }
        }

        vector<int> rightView;
        for (int depth = 0; depth <= max_depth; ++depth) {
            rightView.push_back(rightmostValueAtDepth[depth]);
        }

        return rightView;
    }
};