Leetcode Merge Two Binary Trees python 合并两颗二叉树

Leetcode 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.

---

题目大意: 合并两棵树，有节点的相加，没有节点的就把另一个节点赋予到这里。

上代码：
用递归。 前面两个if的作用跟最后注释掉的一样。 但是注释掉的用了逻辑符号返回，反而不清楚python底层操作的人更迷。

# 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 not t1:
            return t2
        if not t2:
            return t1
        if t1 and t2:
            newTree =   TreeNode(t1.val + t2.val)
            newTree.left = self.mergeTrees(t1.left, t2.left)
            newTree.right = self.mergeTrees(t1.right, t2.right)       
            return newTree
       # else:
            #return t1 or t2

12/04/2020
生日快乐
疫情中的英国，加油！