合并二叉树
刚开始我还以为是合并连通块来着无语子
TreeNode *root=new TreeNode(0);//重新定义节点
这里面的0应该是值
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if(t1==NULL&&t2==NULL) return NULL;
else if(t1==NULL) return t2;
else if(t2==NULL) return t1;
TreeNode *root=new TreeNode(0);//重新定义节点
root->val=t1->val+t2->val;
root->left=mergeTrees(t1->left,t2->left);
root->right=mergeTrees(t1->right,t2->right);
return root;
}
};