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

Fix bst challenge time complexity discussion (#135)

Browse Source
This commit is contained in:
Donne Martin 2017-01-05 22:59:15 -05:00 committed by GitHub
parent 3d49bb1d43
commit 7945ec045d
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
graphs_trees/bst/bst_solution.ipynb
View File

@ -84,7 +84,7 @@
"Complexity:\n",
"\n",
"* Time: O(h), where h is the height of the tree\n",
" * In a balanced tree, the height is O(nlogn)\n",
" * In a balanced tree, the height is O(log(n))\n",
" * In the worst case we have a linked list structure with O(n)\n",
"* Space: O(m), where m is the recursion depth, or O(1) if using an iterative approach"
]