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.