【Leetcode】617. Merge Two Binary Trees

最新推荐文章于 2022-02-28 15:10:15 发布

cheney康

最新推荐文章于 2022-02-28 15:10:15 发布

阅读量174

点赞数

本文链接：https://blog.csdn.net/cheneykl/article/details/79735465

版权

Python 同时被 3 个专栏收录

28 篇文章 0 订阅

订阅专栏

Leetcode

8 篇文章 0 订阅

订阅专栏

Leetcode - python

7 篇文章 2 订阅

订阅专栏

617. Merge Two Binary Trees

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.

class Solution:
    def mergeTrees(self, t1, t2):
        
        if not t1:
            return t2
        elif not t2:
            return t1
        root = TreeNode(t1.val+t2.val)
        root.left = self.mergeTrees(t1.left, t2.left)
        root.right = self.mergeTrees(t1.right , t2.right)
        return root