Access time of a binary search tree may go worse in terms of time complexity upto ..............
A. Ο(n2)
B. Ο(n log n)
C. Ο(n)
D. Ο(1)
Answer:C
Access time of a binary search tree may go worse in terms of time complexity upto ..............
A. Ο(n2) B. Ο(n log n) C. Ο(n) D. Ο(1)