题目:
题解:
思路:(1)递归 (2)対树进行先序遍历,置null的节点为0,两个数进行相加
代码:
//递归
var mergeTrees = function (t1, 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;
};
(ps:第五天)