Simple 5-line C++ Recursive Solution


  • 1
    G
        void connect(TreeLinkNode *root) {
            if (!root) return;
            if (root->left) root->left->next = root->right;
            if (root->next && root->next->left) root->right->next = root->next->left;
            connect(root->left);
            connect(root->right);
        }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.