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

Fixed Big O complexities.

Browse Source
This commit is contained in:
Donne Martin
2015-08-13 06:48:52 -04:00
parent d6efaca8d8
commit d99db4e110
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graphs_trees/bst_min/bst_min_solution.ipynb
View File

@@ -67,8 +67,8 @@
"* Return the node\n", "* Return the node\n",
" \n", " \n",
"Complexity:\n", "Complexity:\n",
"* Time: O(1)\n", "* Time: O(n)\n",
"* Space: O(1)" "* Space: O(h), where h is the tree's height (since this is a tree with minimum height, h = log n)"
] ]
}, },
{ {