1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30 | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left),
* right(right) {}
* };
*/
class Solution {
private:
std::vector<int> ans;
void dfs(TreeNode *node, int depth) {
if (!node)
return;
if (ans.size() < depth)
ans.push_back(node->val);
dfs(node->right, depth + 1);
dfs(node->left, depth + 1);
}
public:
std::vector<int> rightSideView(TreeNode *root) {
dfs(root, 1);
return ans;
}
};
|