Trying to achieve O(1)

• Balanced binary trees are pretty efficient at O(log(n)).

• Sometimes this is still not efficient enough.

• O(1) would be ideal.

• A class of data structures for achieving this is called “hash tables”.

• The process of using hash tables is termed “hashing”