God damnit Sussman

make a BST vs HashTable comparison program
my BST outperforms my HashTable even when nearing 100000 elements on misses

>>9
A map is an ADT and a hash table is one way to implement it. map doesn't mean binary search tree by default.

Dictionary is just a word that's newbie-friendly and helpful to non-programmers.