Leet Code - 두 갈래 나무 오른쪽에서 보기(바이트 댄스 시뮬레이션 면접)

 : [1,2,3,null,5,null,4]
 : [1, 3, 4]
 :

   1             
  
#include 
#include 

using namespace std;
struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};


void print(vector &r){
    for(int i=0;i rightSideView(TreeNode* root) {
        vector level;
        vector ret;
        vector extend;
        if(root==NULL){
            return ret;
        }
        level.push_back(0);
        extend.push_back(root);
        int i = 0;
        while(ileft && p->right){
                    level.push_back(level[i]);
                    extend.push_back(p->left);
                    level.push_back(level[i]);
                    extend.push_back(p->right);
                }else if(p->left){
                    level.push_back(level[i]);
                    extend.push_back(p->left);
                }else if(p->right){
                    level.push_back(level[i]);
                    extend.push_back(p->right);
                }
            }
            i++;
        }
        int c = -1;
        for(int i=level.size()-1;i>=0;i--){
            if(i==level.size()-1){
                c = level[i];
                ret.push_back(extend[i]->val);
            }else if(level[i]val);
            }
        }
        reverse(ret.begin(),ret.end());
        return ret;
    }
};

int main(){
    Solution s;
    TreeNode root(1);
    TreeNode left(2);
    TreeNode right(3);
    TreeNode leftt(4);
    root.left = &left;
    root.right = &right;
    left.left = &leftt;
    vectorret = s.rightSideView(&root);
    print(ret);
    return 0;
}
  
비귀속판, AC100%