199 Binary Tree Right Side View

1 题目

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

Example:

Input: [1,2,3,null,5,null,4]
Output: [1, 3, 4]
Explanation:

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

2 尝试解 

class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        vector<int> result;
        if(root==NULL) return result;
        queue<TreeNode*> layer;
        layer.push(root);
        while(!layer.empty()){
            result.push_back(layer.back()->val);
            int n = layer.size();
            for(int i = 0; i < n;i++){
                if(layer.front()->left) layer.push(layer.front()->left);
                if(layer.front()->right) layer.push(layer.front()->right);
                layer.pop();
            }
        }
        return result;
    }
};

3 标准解

class Solution {
public:
    void recursion(TreeNode *root, int level, vector<int> &res)
    {
        if(root==NULL) return ;
        if(res.size()<level) res.push_back(root->val);
        recursion(root->right, level+1, res);
        recursion(root->left, level+1, res);
    }
    
    vector<int> rightSideView(TreeNode *root) {
        vector<int> res;
        recursion(root, 1, res);
        return res;
    }
};