leetcode-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 == NULL){
            return root;
        }
        help(root);
        return root;
    }
    // 左子树结点next指向他的兄弟结点（父节点的右儿子）
    // 右子树结点的next指向父节点的next的左子树，特别的，如果父节点的next为NULL的话，则直接指向NULL
    void help(Node *root){
        if(root == NULL || (root->left == NULL && root->right == NULL)){
            return;
        }
        root->left->next = root->right;
        root->right->next = (root->next == NULL ? NULL : root->next->left);
        help(root->left);
        help(root->right);
    }
};