C++ Data Structures and Algorithms

Developing the Remove() operation

To remove an element by using a given key, first we have to search the position of the element stored by using a hash key. If the given key is found, then delete the element. If not, find another possible slot using a linear probing calculation, then delete the element if it's found. Each time there's a new element to be removed, we decrease the currentSize variable to track the total elements in the hash table. The implementation of the Remove() operation will be as follows:

void HashTable::Remove(int key){    // Get hash key from hash function    int hashIndex = HashFunction(key);    // Find the element with given key    while(arr[hashIndex] != NULL &&        arr[hashIndex]->Key != deletedElement->Key)    { // If element is ...