Follow up for problem "Populating Next Right Pointers in Each Node".
What if the given tree could be any binary tree? Would your previous solution still work?
Note:
- You may only use constant extra space.
For example,
Given the following binary tree,
1 / \ 2 3 / \ \ 4 5 7
After calling your function, the tree should look like:
1 -> NULL / \ 2 -> 3 -> NULL / \ \ 4-> 5 -> 7 -> NULL
BFS逐层遍历,串联指针
/**
* Definition for binary tree with next pointer.
* struct TreeLinkNode {
* int val;
* TreeLinkNode *left, *right, *next;
* TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
void BFS(TreeLinkNode *root){
if(root==NULL)return;
queue<TreeLinkNode *> que;
que.push(root);
TreeLinkNode *p=NULL,*pre=NULL;
int level1=1,level2=0;
while(!que.empty()){
p=que.front();
que.pop();
--level1;
if(p->left!=NULL){
que.push(p->left);
++level2;
}
if(p->right!=NULL){
que.push(p->right);
++level2;
}
if(pre!=NULL)
pre->next=p;
pre=p;
if(level1==0){
p->next=NULL;
pre=NULL;
level1=level2;
level2=0;
}
}
}
public:
void connect(TreeLinkNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
BFS(root);
}
};