【树】leetcode_199_二叉树的右视图

【树】leetcode_199_二叉树的右视图

/**
 * 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) {


        TreeNode *cur = root;
        vector<int> layer;
        vector<vector<int>> result; 
        if (root == nullptr) return {};
        queue<TreeNode*> q_node;

        q_node.push(root);
        while(!q_node.empty()){
            int size = q_node.size();
            for(int i = 0; i<size; i++){
                cur = q_node.front();
                q_node.pop();
                layer.push_back(cur->val);
                
                if (cur->left){
                    q_node.push(cur->left);
                }
                if (cur->right){
                    q_node.push(cur->right);
                }
            }
            result.push_back(layer);
            layer.clear();
        }

        vector<int> the_re;
        for (vector<int> i :result){
            the_re.push_back(i.back());
        }
        return the_re;
        
    }
};