Now we've got another data structure to add to our collection (hashing joins heaps, lists, binary search trees, splay trees, etc.)
Each has different running time properties.
We can also combine them in various ways.
