树：力扣617. 合并二叉树

1、题目描述：

2、题解：

# 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 and not t2:
            return 
        if not t1 and t2:
            return t2
        if t1 and not t2:
            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

3、复杂度分析：

时间复杂度：O(min(m,n)),m、n是两个二叉树的结点数
空间复杂度：O(min(m,n))