116.右侧节点

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* left;
    Node* right;
    Node* next;

    Node() : val(0), left(NULL), right(NULL), next(NULL) {}

    Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {}

    Node(int _val, Node* _left, Node* _right, Node* _next)
        : val(_val), left(_left), right(_right), next(_next) {}
};
*/

class Solution {
public:
    Node* connect(Node* root) {
        if(!root)return NULL;

        root->next=NULL;
        connectNext(root);

        return root;
    }

    void connectNext(Node* root)
    {
        if(root->left==NULL)
        {
            return;
        }

        Node* p=root;

        while(p->next!=NULL)
        {
            p->left->next=p->right;
            p->right->next=p->next->left;
            p=p->next;
        }

        p->left->next=p->right;
        p->right->next=NULL;

        connectNext(root->left);        
    }
};