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) return;
if (root)
{
if(root->left&&root->right)
{
root->left->next=root->right;
if(root->next)
{
root->right->next=root->next->left;
}
else root->right->next=NULL;
connect(root->left);
connect(root->right);
}
}
    }
};