C++ Data Structures and Algorithms

Developing an IsEmpty() operation

Since we have a currentSize variable that stores the total number of elements in the hash table, to see if the hash table is empty, we just need to check if the currentSize variable equals to 0. The implementation of the IsEmpty() operation will be as follows:

bool HashTable::IsEmpty(){    return currentSize == 0;}

Differ with IsEmpty() operation in our previous separate chaining technique, it's guaranteed to have O(1) time complexity for all cases with a IsEmpty() operation in the linear probing technique, since we have tracked the size of the hash table each time we've performed Insert() and Remove() operation.