Self – balancing binary search trees have a much better average-case time complexity than hash tables.

› Category: Questions › Self – balancing binary search trees have a much better average-case time complexity than hash tables.
0 Vote Up Vote Down
Editor">Editor Staff asked 1 month ago

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.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 1 month ago

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.