树的层序遍历
1. 在层序遍历的基础上添加两个变量,1)current用于标记当前层的节点树 2)count用于统计下一层的节点数
2. 当current!=0时在当前层内,next指向队列的下一个节点,当count==0时当前层遍历结束,next指向NULL
/*
// Definition for a Node.
class Node {
public:
int val;
Node* left;
Node* right;
Node* next;
Node() : val(0), left(NULL), right(NULL), next(NULL) {}
Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}
Node(int _val, Node* _left, Node* _right, Node* _next)
: val(_val), left(_left), right(_right), next(_next) {}
};
*/
class Solution {
public:
/*层序遍历*/
Node* connect(Node* root) {
if(root==nullptr){
return root;
}
queue<Node*> q;
q.push(root);
int count = 0;
int current = 1;
while(!q.empty()){
Node *p = q.front();
q.pop();
current--;
if(p==nullptr){
break;
}
if(p->left!=nullptr){
q.push(p->left);
count++;
}
if(p->right!=nullptr){
q.push(p->right);
count++;
}
if(current == 0){
p->next = NULL;
current = count;
count = 0;
}else{
p->next = q.front();
}
}
return root;
}
};