class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
vector<int> res;
if(root == NULL)
return res;
queue<TreeNode*> q;
q.push(root);
while(!q.empty()){
int size=q.size();
vector<int> level;
for(int i=0;i<size;i++){
TreeNode* node=q.front();
q.pop();
level.push_back(node->val);
if(node->left!=NULL)
q.push(node->left);
if(node->right!=NULL)
q.push(node->right);
}
res.push_back(level[level.size()-1]);
}
return res;
}
};
199. Binary Tree Right Side View
最新推荐文章于 2021-04-27 22:33:11 发布