def invertTree(self, root: TreeNode) -> TreeNode:
if not root: return
root.right, root.left = root.left, root.right
self.invertTree(root.left)
self.invertTree(root.right)
return root
def invertTree(self, root: TreeNode) -> TreeNode:
if not root: return
root.right, root.left = root.left, root.right
self.invertTree(root.left)
self.invertTree(root.right)
return root