Python solution in three lines


  • 1
    C

    The time is around 48ms.

        def invertTree(self, root):
            """
            :type root: TreeNode
            :rtype: TreeNode
            """
            if root:
                root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)
            return root
    

Log in to reply
 

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