mirror of
https://github.com/donnemartin/interactive-coding-challenges.git
synced 2024-03-22 13:11:13 +08:00
Fixed Big O complexities.
This commit is contained in:
parent
d6efaca8d8
commit
d99db4e110
|
@ -67,8 +67,8 @@
|
|||
"* Return the node\n",
|
||||
" \n",
|
||||
"Complexity:\n",
|
||||
"* Time: O(1)\n",
|
||||
"* Space: O(1)"
|
||||
"* Time: O(n)\n",
|
||||
"* Space: O(h), where h is the tree's height (since this is a tree with minimum height, h = log n)"
|
||||
]
|
||||
},
|
||||
{
|
||||
|
|
Loading…
Reference in New Issue
Block a user