Hash Table

1. Chain with linked lists, O(n) worst-case lookup
2. Chain with binary search trees, O(log n) worst-case