原题地址:617. Merge Two Binary Trees。
解法
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if (!t1)
return t2;
if (!t2)
return t1;
TreeNode *p = new TreeNode(t1->val + t2->val);
p->left = mergeTrees(t1->left, t2->left);
p->right = mergeTrees(t1->right, t2->right);
return p;
}
参考: