LeetCode每日一题 (28) 117. 填充每个节点的下一个右侧节点指针II
class Solution {
public:
Node* connect(Node* root) {
queue<Node*> Q;
Node *p,*pre;
if(root==NULL) return root;
Q.push(root);
while(!Q.empty()){
int len=Q.size();
pre=Q.front();
Q.pop();
if(pre->left!=NULL) Q.push(pre->left);
if(pre->right!=NULL) Q.push(pre->right);
for(int i=1;i<len;i++){
p=Q.front();
Q.pop();
pre->next=p;
pre=p;
if(p->left!=NULL) Q.push(p->left);
if(p->right!=NULL) Q.push(p->right);
}
pre->next=NULL;
}
return root;
}
};