给定一棵二叉树,想象自己站在它的右侧,按照从顶部到底部的顺序,返回从右侧所能看到的节点值。
示例:
输入: [1,2,3,null,5,null,4] 输出: [1, 3, 4] 解释: 1 <--- / \ 2 3 <--- \ \ 5 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;
queue<TreeNode*> vec;
if(root==NULL)
return res;
vec.push(root);
while(!vec.empty()){
vector<int> temp;
int n = vec.size();
for(int i=0;i<n;++i){
TreeNode* topnode = vec.front();
vec.pop();
if(topnode->left!=NULL)
vec.push(topnode->left);
if(topnode->right!=NULL)
vec.push(topnode->right);
temp.push_back(topnode->val);
}
res.push_back(temp.back());
}
return res;
}
};