GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-07 09:58:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixed Big O space complexities.

Browse Source
This commit is contained in:
Donne Martin
2015-08-13 06:52:15 -04:00
parent e50dff94b0
commit 224aef1d47
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
graphs_trees/tree_dfs/dfs_solution.ipynb
View File

@@ -75,7 +75,7 @@
"\n",
"Complexity:\n",
"* Time: O(n)\n",
"* Space: O(log n)\n",
"* Space: O(h), where h is the height of the tree\n",
"\n",
"Note:\n",
"* This is a form of a depth-first traversal\n",
@@ -88,7 +88,7 @@
"\n",
"Complexity:\n",
"* Time: O(n)\n",
"* Space: O(log n)\n",
"* Space: O(h), where h is the height of the tree\n",
"\n",
"Note:\n",
"* This is a form of a depth-first traversal\n",
@@ -101,7 +101,7 @@
"\n",
"Complexity:\n",
"* Time: O(n)\n",
"* Space: O(log n)\n",
"* Space: O(h), where h is the height of the tree\n",
"\n",
"Note:\n",
"* This is a form of a depth-first traversal"