python--leetcode617. Merge Two Binary Trees

最新推荐文章于 2022-11-26 00:18:17 发布

哎呦不错的温jay

最新推荐文章于 2022-11-26 00:18:17 发布

阅读量1k

点赞数 1

分类专栏： python 文章标签： python leetcode

本文链接：https://blog.csdn.net/wenqiwenqi123/article/details/78056895

版权

python 专栏收录该内容

145 篇文章

订阅专栏

本文介绍了一种将两棵二叉树合并的具体方法，当两棵树的节点重叠时求和，否则取非空节点值。通过递归实现，提供两种实现代码供参考。

摘要生成于 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:

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.

这题的意思就是把两个二叉树合并，如果某位置两个树都有则想加，如果只有一颗有就直接取那个数值。

本题用递归做方便，以下为代码：

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

class Solution(object):
    def mergeTrees(self, t1, t2):
        """
        :type t1: TreeNode
        :type t2: TreeNode
        :rtype: TreeNode
        """
       
        if not t1 and not t2: return None
        ans = TreeNode((t1.val if t1 else 0) + (t2.val if t2 else 0))
        ans.left = self.mergeTrees(t1 and t1.left, t2 and t2.left)
        ans.right = self.mergeTrees(t1 and t1.right, t2 and t2.right)
        return ans

当然，还有另一代码，思路类似：

class Solution(object):
    def mergeTrees(self, t1, t2):
        if t1 and t2:
            root = TreeNode(t1.val + t2.val)
            root.left = self.mergeTrees(t1.left, t2.left)
            root.right = self.mergeTrees(t1.right, t2.right)
            return root
        else:
            return t1 or t2