Simplest Python solution


  • 6
    S
    class Solution:
        def invertTree(self, root):
            if not root:
                return
            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.