199二叉树的右视图

1.广搜

class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        if(root==nullptr) return {};
        vector<int> res;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()){
            int size = q.size();
            for(int i=0;i<size;i++){
                TreeNode* node = q.front();
                q.pop();
                if(node->left) q.push(node->left);
                if(node->right) q.push(node->right);
                if(i==size-1) {
                    res.push_back(node->val);
                }
            }
        }
        return res;
    }
};

2.深搜

class Solution {
private:
    vector<int> res;
public:
    vector<int> rightSideView(TreeNode* root) {
        dfs(root,0);
        return res;
    }
    void dfs(TreeNode* root,int depth){
        if(root==nullptr) return;
        if(depth==res.size()) res.push_back(root->val);
        depth++;
        dfs(root->right,depth);
        dfs(root->left,depth);
    }