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]
.
BFS层级遍历变种,使用deque,目的是可以取尾巴上的值
* 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> ret;
deque<TreeNode*> que;
if (root)
que.push_back(root);
while (!que.empty())
{
ret.push_back(que.back()->val);
int size = que.size();
for (int i = 0; i < size; i++)
{
TreeNode *p = que.front();
que.pop_front();
if (p->left)
que.push_back(p->left);
if (p->right)
que.push_back(p->right);
}
}
return ret;
}
};