Table of Contents
OK, we've got our hash functions. They're not perfect, so we can expect collisions. How do we resolve these collisions?
There are two general approaches:
Structural Indexing: The hash table performs as an “index” to a set of structures that hold multiple items.
Open Addressing: Search for an open slot within the table.