C++ solution: simple recursive


  • 0
    D
    class Solution {
    public:
        void connect(TreeLinkNode *root) {
            if(!root) return;
            if(root->left)
            {
                root->left->next = root->right;
                if(root->next) 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.