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 {
public:
void connect(TreeLinkNode *root) {
if(root==NULL)
return;
TreeLinkNode* parent=root;
TreeLinkNode* child=NULL;
TreeLinkNode* nextparent=NULL;
while(parent){
if(parent->left){
if(child)
child->next=parent->left;
child=parent->left;
if(nextparent==NULL)
nextparent=child;
}
if(parent->right){
if(child)
child->next=parent->right;
child=parent->right;
if(nextparent==NULL)
nextparent=child;
}
parent=parent->next;
}
connect(nextparent);
}
};