199. Binary Tree Right Side View

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.

For example:
Given the following binary tree,

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

You should return [1, 3, 4].

/**
 * 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> res;
    int maxLevel = -1;
    void dfs(TreeNode* root, int level){
        if(root == NULL) return;
        else {
            if(level > maxLevel){
                maxLevel = level;
                res.push_back(root->val);
            } else 
                res[level] = root->val;
        }
        dfs(root->left, level + 1);
        dfs(root->right, level + 1);
    }
    vector<int> rightSideView(TreeNode* root) {
        dfs(root, 0);
        return res;
    }
};

利用bfs的思路把每一层的最后一个保存下来就可以了

/**
 * 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> ret;
        deque<TreeNode*> bfs;
        int parCnt = 0, chCnt = 0;
        int tmp = 0;
        if(root != NULL){
            bfs.push_back(root);
            ret.push_back(root->val);
            parCnt++;
        } else {
            return ret;
        }
        vector<int> vec;
        while(1){
            if(root->left != NULL){
                bfs.push_back(root->left);
                vec.push_back(root->left->val);
                chCnt++;
            } 
            if(root->right != NULL){
                bfs.push_back(root->right);
                vec.push_back(root->right->val);
                chCnt++;
            }
            tmp++;
            if(tmp == parCnt && !vec.empty()){
                ret.push_back(vec.back());
                vec.clear();
                parCnt = chCnt;
                chCnt = 0;
                tmp = 0;
            }
            bfs.pop_front();
            if(bfs.empty())
                break;
            else {
                root = bfs.front();
            }

        }
        return ret;
    }
};