C+++ Simple Recursive AC Solution


  • 0
    H
    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
            if(t1 == NULL && t2 == NULL) return NULL;
            if(t1 != NULL && t2 == NULL) return t1;
            if(t1 == NULL && t2 != NULL) return t2;
            if(t1 != NULL && t2 != NULL){
                t1->val += t2->val;
                t1->left = mergeTrees(t1->left, t2->left);
                t1->right = mergeTrees(t1->right, t2->right);
            }
            
            return t1;
        }

Log in to reply
 

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