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]
.
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int> vi;
vector<TreeNode*> vtn;
if (root == NULL) return vi;
vtn.push_back(root);
while (vtn.size() > 0) {
TreeNode * node= vtn.back();
vi.push_back(node->val);
vtn = getNextDeep(vtn);
}
return vi;
}
vector<TreeNode*> getNextDeep(vector<TreeNode*>& vec) {
std::vector<TreeNode*> v;
for (int i = 0; i < vec.size(); i++) {
if (vec[i]->left) {
v.push_back(vec[i]->left);
}
if (vec[i]->right) {
v.push_back(vec[i]->right);
}
}
return v;
}
};
another:
class Solution {
public:
void dfs(TreeNode* root, int lv, vector<int> &res){
if(!root) return;
if(lv>=res.size()) res.push_back(root->val);
dfs(root->right,lv+1,res);
dfs(root->left,lv+1,res);
}
vector<int> rightSideView(TreeNode* root) {
vector<int> res;
dfs(root, 0, res);
return res;
}
};