clarify space complexity for dfs trees (neetcode-gh#3761)

reywilliams · web-flow · commit f201a57b8286 · 2024-12-07T09:55:57.000-08:00
diff --git a/articles/balanced-binary-tree.md b/articles/balanced-binary-tree.md
@@ -526,7 +526,11 @@ class Solution {
 ### Time & Space Complexity
 
 * Time complexity: $O(n)$
-* Space complexity: $O(n)$
+* Space complexity: $O(h)$  
+  * Best Case ([balanced tree](https://www.geeksforgeeks.org/balanced-binary-tree/)): $O(log(n))$
+  * Worst Case ([degenerate tree](https://www.geeksforgeeks.org/introduction-to-degenerate-binary-tree/)): $O(n)$
+
+> Where $n$ is the number of nodes in the tree and $h$ is the height of the tree.
 
 ---
 
diff --git a/articles/binary-tree-diameter.md b/articles/binary-tree-diameter.md
@@ -520,7 +520,11 @@ class Solution {
 ### Time & Space Complexity
 
 * Time complexity: $O(n)$
-* Space complexity: $O(n)$
+* Space complexity: $O(h)$  
+  * Best Case ([balanced tree](https://www.geeksforgeeks.org/balanced-binary-tree/)): $O(log(n))$
+  * Worst Case ([degenerate tree](https://www.geeksforgeeks.org/introduction-to-degenerate-binary-tree/)): $O(n)$
+
+> Where $n$ is the number of nodes in the tree and $h$ is the height of the tree.
 
 ---
 
diff --git a/articles/depth-of-binary-tree.md b/articles/depth-of-binary-tree.md
@@ -176,7 +176,11 @@ class Solution {
 ### Time & Space Complexity
 
 * Time complexity: $O(n)$
-* Space complexity: $O(n)$
+* Space complexity: $O(h)$  
+  * Best Case ([balanced tree](https://www.geeksforgeeks.org/balanced-binary-tree/)): $O(log(n))$
+  * Worst Case ([degenerate tree](https://www.geeksforgeeks.org/introduction-to-degenerate-binary-tree/)): $O(n)$
+
+> Where $n$ is the number of nodes in the tree and $h$ is the height of the tree.
 
 ---
 
diff --git a/articles/same-binary-tree.md b/articles/same-binary-tree.md
@@ -191,7 +191,11 @@ class Solution {
 ### Time & Space Complexity
 
 * Time complexity: $O(n)$
-* Space complexity: $O(n)$
+* Space complexity: $O(h)$  
+  * Best Case ([balanced tree](https://www.geeksforgeeks.org/balanced-binary-tree/)): $O(log(n))$
+  * Worst Case ([degenerate tree](https://www.geeksforgeeks.org/introduction-to-degenerate-binary-tree/)): $O(n)$
+
+> Where $n$ is the number of nodes in the tree and $h$ is the height of the tree.
 
 ---
 
