问题描述
解题报告
实现代码
/**
* 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>ans;
if(!root){
return ans;
}
queue<TreeNode*>q;
q.push(root);
while(!q.empty()){
ans.push_back(q.front()->val);
int size=q.size();
while(size>0){
if(q.front()->right)
q.push(q.front()->right);
if(q.front()->left)
q.push(q.front()->left);
size--;
q.pop();
}
}
return ans;
}
};