Clean C++ 3 lines and 6 lines recursion


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

    3 lines version

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