Populating Next Right Pointers in Each Node I&II

class Solution {
public:
void connect(TreeLinkNode *root) {
if(!root)return ;
if(root->left)
root->left->next=root->right;
if(root->right)
root->right->next=(root->next)?root->next->left:NULL;
connect(root->left);
connect(root->right);
}
};

class Solution {
public:
void connect(TreeLinkNode *root) {
if(root==NULL)
return ;
TreeLinkNode *p,*q,*nextnode;
p=root;
q=nextnode=NULL;
while(p)
{
if(p->left)
{
if(q)
q->next=p->left;
if(nextnode==NULL)
nextnode=p->left;
q=p->left;
}
if(p->right)
{
if(q)
q->next=p->right;
if(nextnode==NULL)
nextnode=p->right;
q=p->right;
}
p=p->next;
}
connect(nextnode);
}
};