|
|
|
|
|
|
by beagle3
3274 days ago
|
|
|
Simple binary tree is O(n^2) just like a linked list. Unless you know what you know your distributions and are generally proficient in probability theory (in 99% of the cases, neither can be relied on) the only relevant big-O metric is the worst case one |
|
|