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]
.
Difficulty: Medium
Simple Problem.
/**
* 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> flag;
void DFS(TreeNode* root, int depth){
if(root==NULL)
return;
if(ans.size()<=depth)
ans.push_back(root->val);
DFS(root->right,depth+1);
DFS(root->left,depth+1);
return;
}
vector<int> rightSideView(TreeNode* root) {
DFS(root,0);
return ans;
}
};