C++ version


  • 1
    B
    class Solution {
    public:
        TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
            if(t1 == NULL && t2 == NULL) return NULL;
            else if(t1 != NULL && t2 == NULL) return t1;
            else if(t1 == NULL && t2 != NULL) return t2;
            else t1->val = t1->val + t2->val;
            t1->left = mergeTrees(t1->left, t2->left);
            t1->right = mergeTrees(t1->right, t2->right);
            return t1;
        }
    };
    

  • 0
    S

    @BFSBFS
    judgement can be simplified

    TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
            if(!t2) return t1;
            if(!t1) return t2;
            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.