Chain hashing

Maintain a linked list of buckets for each slot in the hash table

Resolve collisions by placing all elements with the same hash key into the same bucket.

-> To determine wether an element is present, hash to its bucket and scan for it.

-> Insertions and deletions are generalizations of lookups.

Last updated