Question: what is the difference between hash table and binary search tree?
Answer: A binary tree is slower to search and insert into, but has the very nice feature of the infix traversal which essentially means that you can iterate through the nodes of the tree in a sorted order. Iterating through the entries of a hash table just doesn't make a lot of sense because they are all scattered in memory.