Populating Next Right Pointers in Each Node II

Populating Next Right Pointers in Each Node IIOct 28 '123191
/ 7859

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 {
void broadSearch(TreeLinkNode* queueS)
{
if(queueS == NULL)
return;
TreeLinkNode* newQueueH = NULL;
TreeLinkNode* newQueueT = NULL;
while(queueS)
{
if(queueS->left)
{
if(newQueueH == NULL)
newQueueH = queueS->left;
if(newQueueT == NULL)
newQueueT = queueS->left;
else{
newQueueT->next = queueS->left;
newQueueT = queueS->left;
}
}
if(queueS->right)
{
if(newQueueH == NULL)
newQueueH = queueS->right;
if(newQueueT == NULL)
newQueueT = queueS->right;
else{
newQueueT->next = queueS->right;
newQueueT = queueS->right;
}

}
queueS = queueS->next;
}
broadSearch(newQueueH );
}
public:
void connect(TreeLinkNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
TreeLinkNode* queueS = root;
broadSearch(queueS);

}
};