Python iterative solution

  • 0
    class Solution(object):
        def mergeTrees(self, t1, t2):
            :type t1: TreeNode
            :type t2: TreeNode
            :rtype: TreeNode
            if t1 is None or t2 is None:
                return t1 or t2
            t1.left = self.mergeTrees(t1.left, t2.left)
            t1.right = self.mergeTrees(t1.right, t2.right)
            t1.val += t2.val
            return t1

  • 0

    @nkukarl This is not iterative. It's recursive.

Log in to reply

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