Add/Remove & Search in Hash Table (Implementation)
Explore how to implement key hash table operations including adding, removing, searching, and resizing entries. Understand collision handling and the time complexity of each operation through practical C++ coding examples.
We'll cover the following...
In the previous lesson, we built a HashTable class and designed a hash function. Using that code, we will implement the main functionalities of a hash table.
Insertion in 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 our input key, we check if there is a hash entry already present at that index (if it does, a collision has occurred). If not, we simply create a new hash entry for the key/value. However, if the index is not NULL, we will traverse through the bucket to check if ...