Today we will look at another way to implement dictionaries, hash tables, that can have faster insert, remove, and search than binary search trees, but with a tradeoff, slow traversals.