We’ll discuss the hash table ADT which supports only a subset of the operations allowed by binary search trees.

The implementation of hash tables is called hashing.

Hashing is a technique used for performing insertions, deletions and finds in constant average time (i.e. O(1))

This data structure, however, is not efficient in operations that require any ordering information among the elements, such as findMin, findMax and printing the entire table in sorted order.