Simple recursive C++ code

  • 0
        TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
            if(t1 == NULL)
                return t2;
            else if(t2 == NULL)
                return t1;
            TreeNode * t = new TreeNode(t1->val+t2->val);
            t->left = mergeTrees(t1->left,t2->left);
            t->right = mergeTrees(t1->right,t2->right);
            return t;

Log in to reply

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