populating-next-right-pointers-in-each-node

Given a binary tree
struct TreeLinkNode {
TreeLinkNode *left;
TreeLinkNode *right;
TreeLinkNode *next;
}

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set toNULL.
Initially, all next pointers are set toNULL.
Note:
You may only use constant extra space.
You may assume that it is a perfect binary tree (ie, all leaves are at the same level, and every parent has two children).

For example,
Given the following perfect binary tree,
1
/ \
2 3
/ \ / \
4 5 6 7

After calling your function, the tree should look like:
1 -> NULL
/ \
2 -> 3 -> NULL
/ \ / \
4->5->6->7 -> NULL

关于题目，可以直接看例子，就是增加了一个指针，连接左右孩子的问题，要注意上面例子里5和6之间也要相连的。

思路：关于树大部分都是递归的思路
代码：

/**
 * 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->left!=NULL && root->right!=NULL)
            root->left->next = root->right;//左节点的next连到右节点
        if(root->next!=NULL && root->right!=NULL)
            root->right->next = root->next->left;//当前节点的右子节点的next连到当前节点next的左子节点上
        connect(root->left);
        connect(root->right);
    }
};