solve 1

Author: lylaminju

invert-binary-tree/pmjuu.py

@@ -0,0 +1,21 @@
+'''
+시간복잡도: O(n)
+공간복잡도: O(n)
+'''
+from typing import Optional
+
+
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+        
+class Solution:
+    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
+        if not root:
+            return None
+
+        root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)
+
+        return root