LeetCode617. Merge Two Binary Trees （思路及python解法）

最新推荐文章于 2024-02-04 15:23:14 发布

原创最新推荐文章于 2024-02-04 15:23:14 发布 · 224 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 2 个专栏收录

179 篇文章

订阅专栏

Python

173 篇文章

订阅专栏

本文介绍了一种将两棵二叉树合并为一棵新二叉树的算法，当两棵树的节点重叠时，新树的节点值为两棵树对应节点值之和；当节点不重叠时，新树采用非空节点。通过递归方法实现，适用于计算机科学和数据结构的学习。

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

合并两个二叉树，用递归方法很简单。

新建TreeNode的时候注意使用括号，否则计算会出错。

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