leetcode-217 合并二叉树

递归法

# 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:
        return self.helper(t1, t2)
    
    def helper(self, t3:TreeNode, t4:TreeNode):

        if t3 == None and t4 == None:
            return t4
        elif t3 == None:
            return t4
        elif t4 == None:
            return t3

        t3.val += t4.val

        t3.left = self.helper(t3.left, t4.left)
        t3.right = self.helper(t3.right, t4.right)

        return t3