Populating_Next_Right_Pointers_in_Each_Node.cc

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (root == NULL || root->left == NULL)
            return;
        root->left->next = root->right;
        if (root->next == NULL)
            root->right->next = NULL;
        else
            root->right->next = root->next->left;
        connect(root->left);
        connect(root->right);
    }
};