1、题目
2、实现
(1)思路
(2)代码
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root1
* @param {TreeNode} root2
* @return {TreeNode}
*/
var mergeTrees = function(root1, root2) {
// 当树1和树2有一个为空的时候,则直接返回另一棵树
if(root1 === null|| root2 ===null) {
return root1 === null ? root2 : root1;
}
// 合并二叉树
return mergeTree(root1, root2);
};
// 递归合并两个二叉树的方法
function mergeTree(tree1, tree2) {
if(tree1 === null || tree2 === null) {
return tree1 === null ? tree2 : tree1;
}
// 合并节点
tree1.val += tree2.val;
// 递归得到合并后的左子树和右子树
tree1.left = mergeTree(tree1.left, tree2.left);
tree1.right = mergeTree(tree1.right, tree2.right);
return tree1;
}
3、参考