题解 | #合并二叉树#
合并二叉树
https://www.nowcoder.com/practice/7298353c24cc42e3bd5f0e0bd3d1d759
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
// write code here
if(t1==nullptr)return t2;
if(t2==nullptr)return t1;
TreeNode* root= new TreeNode(t1->val+t2->val);
root->left=mergeTrees(t1->left, t2->left);
root->right=mergeTrees(t1->right, t2->right);
return root;
}