I studied hash tables in C++ and learned that there are two types of representation of hash tables, one using a tree and another type using an array from a linked list.
Since the hash table provides me with the fastest addition and fastest access, as it requires only one step, except for some cases in which the hash result for more than one key equals one index in the array, then I search within the linked list.