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

输出一个二叉树每一层最右边的结点。

最开始用栈写的，将每个结点丢进栈里，每一层完毕后丢入一个空值。判断一个结点下一个若为空，则是每一层最右边的结点。时间复杂度O(n)，空间复杂度O(n)

后来借鉴评论区的写法又做了一遍，递归遍历，无需用到栈。时间复杂度O(n)，空间复杂度O(1)

/**
 * 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) {		空间复杂度O(n)
        vector<int> ans;
        if (!root) return ans;
        queue<TreeNode*> q;
        q.push(root);
        q.push(NULL);
        while (!q.empty()) {
            TreeNode* cur = q.front();
            q.pop();
            if (cur == NULL) {
                if (!q.empty()) 
                    q.push(NULL);
                continue;
            }
            if (cur->left) q.push(cur->left);
            if (cur->right) q.push(cur->right);
            if (q.front() == NULL) ans.push_back(cur->val);
        }
        return ans;
    }
};

/**
 * 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> ans;
    vector<int> rightSideView(TreeNode* root) {		空间复杂度O(1)
        if (!root) return ans;
        solve(root, 0);
        return ans;
    }
    void solve(TreeNode* root, int depth) {
        if (depth == ans.size()) ans.push_back(root->val);
        if (root->right) solve(root->right, depth + 1);
        if (root->left) solve(root->left, depth + 1);
    }
};