c_cpp 199.cpp

Posted 2021-05-14

/**
 * 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> result;
        if (root == NULL) return result;
        int depth = getDepth(root);
        vector<bool> s;
        for(int i = 0; i < depth; i++){
            s.push_back(false);
        }
        cout << s.size() << endl;
        int floor = 0;
        traverse(root, result, s, floor);
        return result;
    }
    
    void traverse(TreeNode *root,vector<int> &result,vector<bool> &sign,int floor){
        if (root == NULL) return;
        if (sign[floor] == false) {
            result.push_back(root->val);
            sign[floor] = true;
        }
        traverse(root->right, result, sign, floor+1);
        traverse(root->left, result, sign, floor+1);
    }
    
    int getDepth(TreeNode* root) {
        if (root == NULL) return 0;
        int l = getDepth(root->left);
        int r = getDepth(root->right);
        return (r > l ? r : l) + 1;
    }
};