+1 vote
in Data Structures & Algorithms I by (110k points)
Self – balancing binary search trees have a much better average-case time complexity than hash tables.

(a) True

(b) False

My question is taken from Binary Trees in chapter Binary Trees of Data Structures & Algorithms I

This question was posed to me in class test.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct choice is (b) False

Easy explanation - For lookup, insertion and deletion hash table take O(1) time in average-case while self – balancing binary search trees takes O(log n). Therefore, hash tables perform better in average-case.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.