617. Merge Two Binary Trees

最新推荐文章于 2022-04-20 15:25:20 发布

原创最新推荐文章于 2022-04-20 15:25:20 发布 · 206 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 同时被 3 个专栏收录

16 篇文章

订阅专栏

算法

15 篇文章

订阅专栏

leetcode解题之旅

14 篇文章

订阅专栏

本文介绍了一种将两棵二叉树进行合并的方法。通过递归方式调整节点值并合并左右子树，最终实现两棵树的融合。提供了一个Python实现示例。

题目描述

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.

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.

python代码

class Solution:
    def mergeTrees(self, t1, t2):
        """
        :type t1: TreeNode
        :type t2: TreeNode
        :rtype: TreeNode
        """
        if t1 is None:
            return t2
        if t2 is None:
            return t1
        t1.val=t1.val+t2.val
        t1.left = self.mergeTrees(t1.left,t2.left)
        t1.right = self.mergeTrees(t1.right,t2.right)
        return t1