Askmeabout

Lets share our knowledge

What are the worst case and average case complexities of a binary search tree?

Q & A › Category: Data Structure › What are the worst case and average case complexities of a binary search tree?
-1 Vote Up Vote Down
Admin Staff asked 4 years ago

What are the worst case and average case complexities of a binary search tree?
a) O(n), O(n)
b) O(logn), O(logn)
c) O(logn), O(n)
d) O(n), O(logn)

1 Answers
0 Vote Up Vote Down
Admin Staff answered 4 years ago

d) O(n), O(logn)