牛客网BM32合并二叉树c++

合并二叉树

TreeNode* mergeTrees(TreeNode*t1,TreeNode*t2)
{
	if(t1==NULL)return t2;
	if(t1=NULL)return t1;
	root1->val+=root2->val;
	root1->left = mergeTrees(root1->left,root2->left);
	root2->right = mergeTrees(root1->right,root2->right);
	return root1;
}