struct treenode{ //树的结构体
int val;
struct treenode left;
struct treenode right;
}
struct treenode* mergetrees(*t1,*t2) //t1,t2是两棵树
{
if(t1&&t2) //下面括号的语句把t2中的值给t1
{
t1->val+=t2->val;
t1->left=mergetrees(t1->left,t2->left);
t2->right=mergrtrees(t1->right,t2->right);
}
if(t1==NULL)
t1=t2;
return t1;
}