二叉搜索树的最近公共祖先https://www.nowcoder.com/practice/e0cc33a83afe4530bcec46eba3325116?tpId=295&tqId=1024325&ru=/exam/oj&qru=/ta/format-top101/question-ranking&sourceUrl=%2Fexam%2Foj
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;
}