Time: 48 ms (55.21%), Space: 16.4 MB (33.99%) - LeetHub

Author: mardavsj

0226-invert-binary-tree/0226-invert-binary-tree.py

@@ -0,0 +1,7 @@
+class Solution:
+    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
+        if not root: return root
+        leftSide = root.left
+        root.left = self.invertTree(root.right)
+        root.right = self.invertTree(leftSide)
+        return root