B-Tree vs Hash Table

Question

In MySQL, an index type is a b-tree, and access an element in a b-tree is in logarithmic amortized time O(log(n)).

On the other hand, accessing an eleme

Answer 1

I think Hashmaps don't scale as well, and can be expensive when the entire map needs to be rehashed.