- Make each element of T a (possibly empty)
linked list
- If a key hashes to a location, put it on the list for that location
- If two keys hash to the same location, put them on the same list
Of course, not just the keys
ki are stored.
The whole data items for which the ki are keys are stored.