[leetcode] 199. Binary Tree Right Side View 解题报告

题目链接：https://leetcode.com/problems/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].

思路：用类似于先根遍历的DFS，先遍历根，然后右子树，再左子树．并且维护一个还没有被赋值的层的索引．在搜索的时候附带这当前结点的层数，如果当前的结点的层数大于未被赋值的层数就将其加入结果集合中．因为是遍历的顺序是根－＞右子树－＞左子树，这样可以保证右侧的先被遍历到．

代码如下：

/**
 * 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:
    void DFS(TreeNode* root, int curDepth)
    {
        if(!root) return;
        if(depth < curDepth) 
        {
            depth++;
            result.push_back(root->val);
        }
        DFS(root->right, curDepth+1);
        DFS(root->left, curDepth+1);
    }
    
    vector<int> rightSideView(TreeNode* root) {
        if(!root) return {};
        DFS(root, 1);
        return result;
    }
private:
    vector<int> result;
    int depth = 0;
};