Add/Remove & Search in Hash Table (Implementation)

In the previous lesson, you built a HashTable class and designed a hash function. Using that code, implement the main functionalities of a hash table.

Insertion in hash table

Insertion in hash tables is a simple task, and it usually takes a constant amount of time. When the hash function returns the index for your input key, check if there is a hash entry already present at that index (if it does, then a collision has occurred). If not, simply create a new hash entry for the key/value. However, if the index is not null, traverse through the bucket to check if an object with your key exists. A display function is used to display all the key/value pairs of a hash table.

It is possible that the key you are inserting already exists. In this case, simply update the value; otherwise, add the new entry at the next available space of the bucket.