Discription:
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]
Solution:
My solution:
层序遍历,输出每层的最后一个结点。
vector<int> rightSideView(TreeNode* root) {
vector<int> result;
if (!root)
return result;
queue<TreeNode*> que;
que.push(root);
while (!que.empty()){
result.push_back(que.back()->val);
int size = que.size();
while (size-- > 0){
TreeNode *temp = que.front();
que.pop();
if (temp->left)
que.push(temp->left);
if (temp->right)
que.push(temp->right);
}
}
return result;
}
else:
void recursion(TreeNode *root, int level, vector<int> &res)
{
if (root == NULL) return;
if (res.size() == level) res.push_back(root->val);
recursion(root->right, level + 1, res);
recursion(root->left, level + 1, res);
}
vector<int> rightSideView(TreeNode *root) {
vector<int> res;
recursion(root, 0, res);
return res;
}
GitHub-LeetCode: https://github.com/wenwu313/LeetCode