Hash tables

Hash tables implement a dynamic set of kev-value pairs that support the operations $INSERT$, $SEARCH$ and $DELETE$ extremely efficiently-- $O(1)$ on average. A hash tables is an array of slots, where each slot points to the head of a linked list, where specific key-value pairs are stored as nodes. Insertion is done by using a hash function that converts the key into a slot number, which dictates which linked list to insert the pair to. A hash function must map a universe of all possible keys into a slot number.