题目:
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 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> rightSideView(TreeNode* root) {
vector<int> res;
if(root == NULL)
return res;
queue<TreeNode*> a;
queue<TreeNode*> b;
a.push(root);
while(!a.empty()||!b.empty())
{
while(!a.empty())
{
TreeNode* temp = a.front();
a.pop();
if(temp->left != NULL)
b.push(temp->left);
if(temp->right != NULL)
b.push(temp->right);
if(a.empty())
res.push_back(temp->val);
}
while(!b.empty())
{
TreeNode* temp = b.front();
b.pop();
if(temp->left != NULL)
a.push(temp->left);
if(temp->right != NULL)
a.push(temp->right);
if(b.empty())
res.push_back(temp->val);
}
}
return res;
}
};