题解 | #合并二叉树#

```# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param t1 TreeNode类 
# @param t2 TreeNode类 
# @return TreeNode类
#
class Solution:
    def mergeTrees(self , t1: TreeNode, t2: TreeNode) -> TreeNode:
        if t1==None:
            return t2
        if t2==None:
            return t1
        else:
            t1.val+=t2.val
        t1.left=self.mergeTrees(t1.left, t2.left)
        t1.right=self.mergeTrees(t1.right, t2.right)
        return t1
##### 这个题整体思路就是利用递归