struct TreeNode* mergeTrees(struct TreeNode* t1, struct TreeNode* t2){
if(!t1 &&!t2) return;
if(!t1 && t2) return t2;
if(!t2 && t1) return t1;
t1->left = mergeTrees(t1->left, t2->left);
t1->right = mergeTrees(t1->right, t2->right);
t1->val = t1->val + t2->val;
return t1;
}
leetcode-183-合并二叉树-C语言
最新推荐文章于 2022-08-01 21:34:22 发布