LeetCode 617. 【递归】合并二叉树
原题链接
简单
作者:
大明湖的鱼
,
2021-01-03 18:01:45
,
所有人可见
,
阅读 238
不知道为什么return t1 || t2的写法不对
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode* mergeTrees(TreeNode* t1, TreeNode* t2) {
if(t1 && t2){
t1->val += t2->val;
t1->left = mergeTrees(t1->left,t2->left);
t1->right = mergeTrees(t1->right,t2->right);
}
if(t1 != NULL)return t1;
else return t2;
}
};