116的普遍情况
/**
* 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) return;
TreeLinkNode *p=NULL,*q=NULL;
while(root){
if(root->left){
if(!p) p=root->left;
if(!q) q=root->left;
else q->next=root->left,q=q->next;
}
if(root->right){
if(!p) p=root->right;
if(!q) q=root->right;
else q->next=root->right,q=q->next;
}
root=root->next;
}
connect(p);
}
};