mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-03 07:58:02 +00:00
Fix bst challenge time complexity discussion (#135)
This commit is contained in:
@@ -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"
|
||||
]
|
||||
|
||||
Reference in New Issue
Block a user