【Leetcode】Merge Two Binary Trees 合并两个二叉树

wutingyehe

于 2017-10-27 21:26:46 发布

阅读量560

点赞数

分类专栏： leetcode js 二叉树文章标签：二叉树 leetcode js

本文链接：https://blog.csdn.net/wutingyehe/article/details/78369346

版权

二叉树同时被 3 个专栏收录

12 篇文章

订阅专栏

leetcode

3 篇文章

订阅专栏

2 篇文章

订阅专栏

本文介绍了一种将两棵二叉树合并为一棵新二叉树的算法。当两棵树的节点重叠时，合并后的节点值等于这两个节点值之和；如果节点不重叠，则取非空节点作为新树的节点。此过程从两棵树的根节点开始。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.

You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.

Example 1:
这里写图片描述
Note: The merging process must start from the root nodes of both trees.

/**
 * Definition for a binary tree node.
 * function TreeNode(val) {
 *     this.val = val;
 *     this.left = this.right = null;
 * }
 */
/**
 * @param {TreeNode} t1
 * @param {TreeNode} t2
 * @return {TreeNode}
 */
var mergeTrees = function(t1, t2) {
    node = null
    return mergeTrees2(t1, t2, node)
};

function mergeTrees2(t1, t2, node) {
    if(t1 != null && t2 != null) {
        node  = new TreeNode(t1.val+t2.val)
        node.left = mergeTrees2(t1.left, t2.left, node.left)
        node.right = mergeTrees2(t1.right, t2.right, node.right)
    }else {
        node = t1 || t2
    }
    return node
}