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

• A. True
• B. False