C++ Program to Implement Hash Tables Chaining with Singly Linked Lists

This C++ Program demonstrates operations on Hash Tables chaining with Singly Linked Lists.

Here is source code of the C++ Program to demonstrate Hash Tables chaining with Singly Linked Lists. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C++ Program to Implement Hash Tables chaining

```
 * with Singly Linked Lists
```
```
 */
```
```
#include<iostream>
```
```
#include<cstdlib>
```
```
#include<string>
```
```
#include<cstdio>
```
```
using namespace std;
```
```
const int TABLE_SIZE = 128;
```
```
 
```
```
/*
```
```
 * HashNode Class Declaration
```
```
 */
```
```
class HashNode
```
```
{
```
```
    public:
```
```
   .    int key;
```
```
	int value;
```
```
	HashNode* next;
```
```
        HashNode(int key, int value)
```
```
        {
```
```
            this->key = key;
```
```
	    this->value = value;
```
```
	    this->next = NULL;
```
```
        }
```
```
};
```
```
 
```
```
/*
```
```
 * HashMap Class Declaration
```
```
 */
```
```
class HashMap
```
```
{
```
```
    private:
```
```
        HashNode** htable;
```
```
    public:
```
```
        HashMap()
```
```
        {
```

            htable = new HashNode*[TABLE_SIZE];

            for (int i = 0; i < TABLE_SIZE; i++)

```
                htable[i] = NULL;
```
```
        }
```
```
        ~HashMap()
```
```
        {
```

            for (int i = 0; i < TABLE_SIZE; ++i)

```
	    {
```

                HashNode* entry = htable[i];

```
                while (entry != NULL)
```
```
	        {
```

                    HashNode* prev = entry;

                    entry = entry->next;

```
                    delete prev;
```
```
                }
```
```
            }
```
```
            delete[] htable;
```
```
        }
```
```
        /*
```
```
         * Hash Function
```
```
         */
```
```
        int HashFunc(int key)
```
```
        {
```
```
            return key % TABLE_SIZE;
```
```
        }
```
```
 
```
```
        /*
```
```
         * Insert Element at a key
```
```
         */
```
```
        void Insert(int key, int value)
```
```
        {
```

            int hash_val = HashFunc(key);

```
            HashNode* prev = NULL;
```

            HashNode* entry = htable[hash_val];

```
            while (entry != NULL)
```
```
            {
```
```
                prev = entry;
```
```
                entry = entry->next;
```
```
            }
```
```
            if (entry == NULL)
```
```
            {
```

                entry = new HashNode(key, value);

```
                if (prev == NULL)
```
```
	        {
```

                    htable[hash_val] = entry;

```
                }
```
```
	        else
```
```
	        {
```
```
                    prev->next = entry;
```
```
                }
```
```
            }
```
```
            else
```
```
            {
```
```
                entry->value = value;
```
```
            }
```
```
        }
```
```
        /*
```
```
         * Remove Element at a key
```
```
         */
```
```
        void Remove(int key)
```
```
        {
```

            int hash_val = HashFunc(key);

            HashNode* entry = htable[hash_val];

```
            HashNode* prev = NULL;
```

            if (entry == NULL || entry->key != key)

```
            {
```

            	cout<<"No Element found at key "<<key<<endl;

```
                return;
```
```
            }
```
```
            while (entry->next != NULL)
```
```
	    {
```
```
                prev = entry;
```
```
                entry = entry->next;
```
```
            }
```
```
            if (prev != NULL)
```
```
            {
```

                prev->next = entry->next;

```
            }
```
```
            delete entry;
```

            cout<<"Element Deleted"<<endl;

```
        }
```
```
        /*
```
```
         * Search Element at a key
```
```
         */
```
```
        int Search(int key)
```
```
        {
```
```
            bool flag = false;
```

            int hash_val = HashFunc(key);

            HashNode* entry = htable[hash_val];

```
            while (entry != NULL)
```
```
	    {
```
```
                if (entry->key == key)
```
```
	        {
```

                    cout<<entry->value<<" ";

```
                    flag = true;
```
```
                }
```
```
                entry = entry->next;
```
```
            }
```
```
            if (!flag)
```
```
                return -1;
```
```
        }
```
```
};
```
```
/*
```
```
 * Main Contains Menu
```
```
 */
```
```
int main()
```
```
{
```
```
    HashMap hash;
```
```
    int key, value;
```
```
    int choice;
```
```
    while (1)
```
```
    {
```

        cout<<"\n----------------------"<<endl;

        cout<<"Operations on Hash Table"<<endl;

        cout<<"\n----------------------"<<endl;

        cout<<"1.Insert element into the table"<<endl;

        cout<<"2.Search element from the key"<<endl;

        cout<<"3.Delete element at a key"<<endl;

```
        cout<<"4.Exit"<<endl;
```
```
        cout<<"Enter your choice: ";
```
```
        cin>>choice;
```
```
        switch(choice)
```
```
        {
```
```
        case 1:
```

            cout<<"Enter element to be inserted: ";

```
            cin>>value;
```

            cout<<"Enter key at which element to be inserted: ";

```
            cin>>key;
```
```
            hash.Insert(key, value);
```
```
            break;
```
```
        case 2:
```

            cout<<"Enter key of the element to be searched: ";

```
            cin>>key;
```

            cout<<"Element at key "<<key<<" : ";

```
            if (hash.Search(key) == -1)
```
```
            {
```

	        cout<<"No element found at key "<<key<<endl;

```
	        continue;
```
```
	    }
```
```
            break;
```
```
        case 3:
```

            cout<<"Enter key of the element to be deleted: ";

```
            cin>>key;
```
```
            hash.Remove(key);
```
```
            break;
```
```
        case 4:
```
```
            exit(1);
```
```
        default:
```

           cout<<"\nEnter correct option\n";

```
       }
```
```
    }
```
```
    return 0;
```
```
}
```

$ g++ hash_singly.cpp
$ a.out
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 1
Enter element to be inserted: 12
Enter key at which element to be inserted: 1
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 1
Enter element to be inserted: 24
Enter key at which element to be inserted: 1
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 1
Enter element to be inserted: 36
Enter key at which element to be inserted: 1
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 1
Enter element to be inserted: 48
Enter key at which element to be inserted: 2
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 1
Enter element to be inserted: 60
Enter key at which element to be inserted: 2
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 2
Enter key of the element to be searched: 1
Element at key 1 : 12 24 36 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 2
Enter key of the element to be searched: 2
Element at key 2 : 48 60 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 3
Enter key of the element to be deleted: 4
No Element found at key 4
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 2
Enter key of the element to be searched: 1
Element at key 1 : 12 24 36 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 3
Enter key of the element to be deleted: 1
Element Deleted
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 2
Enter key of the element to be searched: 5
Element at key 5 : No element found at key 5
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 2
Enter key of the element to be searched: 1
Element at key 1 : 12 24 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 1
Enter element to be inserted: 36
Enter key at which element to be inserted: 1
 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 2
Enter key of the element to be searched: 1
Element at key 1 : 12 24 36 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 2
Enter key of the element to be searched: 2
Element at key 2 : 48 60 
----------------------
Operations on Hash Table
 
----------------------
1.Insert element into the table
2.Search element from the key
3.Delete element at a key
4.Exit
Enter your choice: 4
 
 
------------------
(program exited with code: 1)
Press return to continue

Sanfoundry Global Education & Learning Series – 1000 C++ Programs.

If you wish to look at all C++ Programming examples, go to C++ Programs.

If you find any mistake above, kindly email to [email protected]

« Prev - C++ Program to Implement Hash Tables Chaining with Binary Trees

» Next - C++ Program to Implement Hash Tables Chaining with Doubly Linked Lists

Related Posts:

Recommended Articles: