/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> rightSideView(TreeNode* r) {
queue<TreeNode*>q;
if(r!=nullptr){
q.push(r);
q.push(nullptr);
}
vector<int> ret;
while(!q.empty()){
auto tp = q.front();
q.pop();
if( tp == nullptr ){
if(!q.empty()){
q.push(nullptr);
}else{
break;
}
}else{
ret.push_back(tp->val);
if(tp->left!=nullptr){
q.push(tp->left);
}
if(tp->right!=nullptr){
q.push(tp->right);
}
}
}
return ret;
}
};
二叉树层次遍历,使用nullptr分割层次
最新推荐文章于 2022-12-09 12:13:36 发布