题解 | #合并二叉树#

# 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 search(self, this1, this2):
        if this1 is not None and this2 is not None:
            this1.val = this1.val + this2.val
            if this1.left is not None and this2.left is not None:
                self.search(this1.left,this2.left)
            elif this1.left is None and this2.left is not None:
                this1.left = this2.left
            else:
                pass
            
            if this1.right is not None and this2.right is not None:
                self.search(this1.right,this2.right)
            elif this1.right is None and this2.right is not None:
                this1.right = this2.right
            else:
                pass


    def mergeTrees(self , t1: TreeNode, t2: TreeNode) -> TreeNode:
        # write code here

        self.search(t1,t2)

        return t1