【Tree】617. Merge Two Binary Trees

echobingo

发布于 2019-05-15 09:55:37

2600

发布于 2019-05-15 09:55:37

问题描述：

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:

Input: 
    Tree 1                     Tree 2                  
          1                         2                             
         / \                       / \                            
        3   2                     1   3                        
       /                           \   \                      
      5                             4   7                  
Output: 
Merged tree:
         3
        / \
       4   5
      / \   \ 
     5   4   7

Note:The merging process must start from the root nodes of both trees.

解题思路：

从根节点开始，如果其中一棵子树为空，直接拷贝另一棵子树到合并的树上。如果都不为空，直接加和当前节点的值，然后递归左右子树。

合并树可以新建一棵树，也可以使用两棵子树中的一个。代码采取前者。

Python3 实现：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def mergeTrees(self, t1: TreeNode, t2: TreeNode) -> TreeNode:
        if t1 == None and t2 == None:
            return None 
        elif t1 == None:
            return t2
        elif t2 == None:
            return t1
        t = TreeNode(t1.val + t2.val)
        t.left = self.mergeTrees(t1.left, t2.left)
        t.right = self.mergeTrees(t1.right, t2.right)
        return t

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2019.05.10 ，如有侵权请联系 cloudcommunity@tencent.com 删除

node.js

本文分享自作者个人站点/博客前往查看

如有侵权，请联系 cloudcommunity@tencent.com 删除。

本文参与腾讯云自媒体分享计划，欢迎热爱写作的你一起参与！

node.js

登录后参与评论

0 条评论

热度