Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?
A. Ο(n)
B. Ο(n2)
C. Ο(n3)
D. None of these
Answer:A
Binary search tree has best case run-time complexity of Ο(log n). What could the worst case?
A. Ο(n) B. Ο(n2) C. Ο(n3) D. None of these