Comparison
  Hash Table vs Self-Balancing Binary Trees
Hash Tables
  DAT(Direct Access Tables), Internal Implementation of HT, Hash Collision(Solutions: Open Addressing, Seperate Chaining), Rehashing, Implementations(2-left hashing, d-left hashing), Code
Probabilistic Data Structures: Why PDS, Bloom Filter