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]
.
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
void visit(TreeNode *root, int layer, vector<int> &result)
{
if (root)
{
if (layer >= result.size())
{
result.push_back(root->val);
}
visit(root->right, layer+1, result);
visit(root->left, layer+1, result);
}
}
vector<int> rightSideView(TreeNode *root) {
vector<int> result;
visit(root, 0, result);
return result;
}
};