Python solution,7 lines,use recursive, easy to understand

  • 0
    # Definition for a binary tree node.
    # class TreeNode(object):
    #     def __init__(self, x):
    #         self.val = x
    #         self.left = None
    #         self.right = None
    class Solution(object):
        def mergeTrees(self, t1, t2):
            :type t1: TreeNode
            :type t2: TreeNode
            :rtype: TreeNode
            if t1 is not None and t2 is not None:
                t1.val += t2.val
                t1.left = self.mergeTrees(t1.left, t2.left)
                t1.right = self.mergeTrees(t1.right, t2.right)
            elif t1 is None and t2 is not None:
                t1 = t2
            return t1

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.