Update Invert Binary Tree - Leetcode 226.py

Author: gahogg

Invert Binary Tree - Leetcode 226/Invert Binary Tree - Leetcode 226.py

@@ -1,3 +1,4 @@
+# YouTube Solution
 class Solution:
     def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
 
@@ -13,3 +14,21 @@ def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
 
 # Time Complexity: O(n)
 # Space Complexity: O(h) { here "h" is the height of the tree }
+
+
+# Solution for Bootcamp
+class Solution:
+    def invertTree(self, root: Optional[TreeNode]) -> Optional[TreeNode]:
+        def invert(node):
+            if not node:
+                return
+                
+            node.left, node.right = node.right, node.left
+            invert(node.left)
+            invert(node.right)
+
+        invert(root)
+        return root
+
+# Time Complexity: O(n)
+# Space Complexity: O(h) { here "h" is the height of the tree }