[leetcode] 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].

————————————————————————————————

虽然题目等级是medium但是似乎是道相当easy的题目，主要是我太水，要是有朋友了解其中的玄机请务必告诉我

如果借助队列或者容器很容易得出每一层的全部节点，之后按需提取就好

所以我写了一个递归的方法，避免使用外部空间，多加了一个参数n，代表该节点的层数，如果该层之前有过到达则不输出，反之输出，代码如下

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:

    vector<int> ans;
    int level;
    
    vector<int> rightSideView(TreeNode *root) {
        level= 0;
        helper(root, 1);
        return ans;
    }
    
    void helper(TreeNode *p, int n){
        if(p== NULL)  return;
        
        if(n> level){
            ans.push_back(p->val);
            level= n;
        }
        
        helper(p->right, n+ 1);
        helper(p->left, n+ 1);
    }
};