Scribd
Upload
5 views2 pages

Insert - Deletion in Hash Table

The document contains a C++ implementation of a hash table using chaining for collision resolution. It includes methods for inserting and removing elements, as well as printing the contents of the table. The example demonstrates creating a hash table, inserting elements, and removing an element, with output showing the state of the table before and after deletion.

Uploaded by

Sweety Jachak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
5 views2 pages

Insert - Deletion in Hash Table

The document contains a C++ implementation of a hash table using chaining for collision resolution. It includes methods for inserting and removing elements, as well as printing the contents of the table. The example demonstrates creating a hash table, inserting elements, and removing an element, with output showing the state of the table before and after deletion.

Uploaded by

Sweety Jachak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

#include <iostream>

#include <list>

using namespace std;

class HashTable{
private:
list<int> *table;
int total_elements;

// Hash function to calculate hash for a value:


int getHash(int key){
return key % total_elements;
}

public:
// Constructor to create a hash table with 'n' indices:
HashTable(int n){
total_elements = n;
table = new list<int>[total_elements];
}

// Insert data in the hash table:


void insertElement(int key){
table[getHash(key)].push_back(key);
}

// Remove data from the hash table:


void removeElement(int key){
int x = getHash(key);

list<int>::iterator i;
for (i = table[x].begin(); i != table[x].end(); i++) {
// Check if the iterator points to the required item:
if (*i == key)
break;
}

// If the item was found in the list, then delete it:


if (i != table[x].end())
table[x].erase(i);
}

void printAll(){
// Traverse each index:
for(int i = 0; i < total_elements; i++){
cout << "Index " << i << ": ";
// Traverse the list at current index:
for(int j : table[i])
cout << j << " => ";

cout << endl;


}
}
};

int main() {
// Create a hash table with 3 indices:
HashTable ht(3);
// Declare the data to be stored in the hash table:
int arr[] = {2, 4, 6, 8, 10};

// Insert the whole data into the hash table:


for(int i = 0; i < 5; i++)
ht.insertElement(arr[i]);

cout << "..:: Hash Table ::.." << endl;


ht.printAll();

ht.removeElement(4);
cout << endl << "..:: After deleting 4 ::.." << endl;
ht.printAll();

return 0;
}

---------OUTPUT---------
..:: Hash Table ::..
Index 0: 6 =>
Index 1: 4 => 10 =>
Index 2: 2 => 8 =>

..:: After deleting 4 ::..


Index 0: 6 =>
Index 1: 10 =>
Index 2: 2 => 8 =>

You might also like