StarMirror/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges.git synced 2024-03-22 13:11:13 +08:00
Code Issues 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
Show Stats 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", "\n",
"Complexity:\n", "Complexity:\n",
"* Time: O(n)\n", "* Time: O(n)\n",
"* Space: O(log n)\n", "* Space: O(h), where h is the height of the tree\n",
"\n", "\n",
"Note:\n", "Note:\n",
"* This is a form of a depth-first traversal\n", "* This is a form of a depth-first traversal\n",
@ -88,7 +88,7 @@
"\n", "\n",
"Complexity:\n", "Complexity:\n",
"* Time: O(n)\n", "* Time: O(n)\n",
"* Space: O(log n)\n", "* Space: O(h), where h is the height of the tree\n",
"\n", "\n",
"Note:\n", "Note:\n",
"* This is a form of a depth-first traversal\n", "* This is a form of a depth-first traversal\n",
@ -101,7 +101,7 @@
"\n", "\n",
"Complexity:\n", "Complexity:\n",
"* Time: O(n)\n", "* Time: O(n)\n",
"* Space: O(log n)\n", "* Space: O(h), where h is the height of the tree\n",
"\n", "\n",
"Note:\n", "Note:\n",
"* This is a form of a depth-first traversal" "* This is a form of a depth-first traversal"