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
/**
* 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) {
while (root)
{
TreeLinkNode * pre = nullptr;
for (auto cur = root; cur; cur=cur->next)
{
if (cur->left)
{
if (pre == nullptr)
root = cur->left;
else
pre->next = cur->left;
pre = cur->left;
}
if (cur->right)
{
if (pre == nullptr)
root = cur->right;
else
pre->next = cur->right;
pre = cur->right;
}
}
if (pre == nullptr) //No next root found.
break;
}
}
};