116. Populating Next Right Pointers in Each Node

/**
* 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)||(root->left==NULL&&root->right==NULL))
return;
else
{

connect(root->left);
connect(root->right);

TreeLinkNode *temp1=root->left;
TreeLinkNode *temp2=root->right;
while(temp1!=NULL&&temp2!=NULL)
{
temp1->next=temp2;
temp1=temp1->right;
temp2=temp2->left;

}

return;
}
}
};