Hash tables v self-balancing search trees

Question

I am curious to know what is the reasoning that could overweighs towards using a self-balancing tree technique to store items than using a hash table.

I see that hash

Answer 1

I think if you want to query for a range of keys instead of one key, self balanced tree structure will perform better than a hash table structure.