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
Subscribe to see which companies asked this question
/**
* 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) {
TreeLinkNode *preLevelHeader = root;
while (preLevelHeader)
{
TreeLinkNode* parentNode = preLevelHeader;
TreeLinkNode* curNode = NULL;
preLevelHeader = NULL;
while (parentNode)
{
if (parentNode->left)
{
if (curNode == NULL)
{
curNode = parentNode->left;
preLevelHeader = curNode;
}
else
{
curNode->next = parentNode->left;
curNode = curNode->next;
}
}
if (parentNode->right)
{
if (curNode == NULL)
{
curNode = parentNode->right;
preLevelHeader = curNode;
}
else
{
curNode->next = parentNode->right;
curNode = curNode->next;
}
}
parentNode = parentNode->next;
}
}
}
};