题目链接:https://leetcode.com/problems/merge-two-binary-trees/
题目大意:给定两棵二叉树,合并两棵二叉树并将对应数值相加。
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if(t1 == NULL){
return t2;
}
if(t2 == NULL){
return t1;
}
t1->val += t2->val;
t1->left = mergeTrees(t1->left,t2->left);
t1->right = mergeTrees(t1->right,t2->right);
return t1;
}
};