neetcode-gh
diff --git a/‎articles/binary-tree-from-preorder-and-inorder-traversal.md
Lines changed: 3 additions & 3 deletions b/‎articles/binary-tree-from-preorder-and-inorder-traversal.md
Lines changed: 3 additions & 3 deletions
@@ -240,11 +240,11 @@ class Solution {
 ### Time & Space Complexity
 
 * Time complexity: $O(n ^ 2)$
-* Space complexity: $O(n ^ 2)$
+* Space complexity: $O(n)$
 
 ---
 
-## 2. Hash Map
+## 2. Hash Map + Depth First Search
 
 ::tabs-start
 
@@ -780,4 +780,4 @@ class Solution {
 ### Time & Space Complexity
 
 * Time complexity: $O(n)$
-* Space complexity: $O(n)$
+* Space complexity: $O(n)$ for recursion stack.