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
void connect(TreeLinkNode *root) {
if (!root) return;
TreeLinkNode dummy(INT_MIN);
for (TreeLinkNode *cur = root, *pre = &dummy; cur; cur = cur->next) {
if (cur->left) {
pre->next = cur->left;
pre = pre->next;
}
if (cur->right) {
pre->next = cur->right;
pre = pre->next;
}
}
connect(dummy.next);
}
void connect(TreeLinkNode *root) {
TreeLinkNode *now, *tail, *head;
now = root;
head = tail = NULL;
while(now)
{
if (now->left)
if (tail) tail = tail->next =now->left;
else head = tail = now->left;
if (now->right)
if (tail) tail = tail->next =now->right;
else head = tail = now->right;
if(!(now = now->next))
{
now = head;
head = tail=NULL;
}
}
}