Python clean solution

  • 0
    class Solution(object):
        def mergeTrees(self, t1, t2):
            if not t1 or not t2:
                return t1 or t2
            t1.val = t1.val + t2.val
            t1.left = self.mergeTrees(t1.left,t2.left)
            t1.right = self.mergeTrees(t1.right,t2.right)
            return t1

Log in to reply

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