Hashing

#include<iostream>
#include<cstdlib>
#include<stdio.h>

using namespace std;

int SIZE;
struct Node
{
    int val;
    Node * next;
};

struct LinkedList
{
private:
    Node ** hashTable;
public:
    void init(int s)
    {
        SIZE = s;
        hashTable = (Node**)calloc(SIZE,sizeof(Node*));
    }

    int hashFunc(int key)
    {
        return key%SIZE;
    }

    void insertValue(int v)
    {
        Node * newnode = new Node;
        newnode->val = v;
        newnode->next = NULL;

        int index = hashFunc(v);
        if(hashTable[index] == NULL)
        {
        hashTable[index]=(Node*)malloc(sizeof(Node*));
        hashTable[index]=newnode;
        }
        else
        {
         Node* temp = new Node;
         temp = hashTable[index];
         newnode->next=temp;
         hashTable[index]=newnode;
        }
    }
    int searchValue(int v)
    {
       int index = hashFunc(v);
       if(hashTable[index]==NULL)
       {
           cout<<"Index is completely empty thus "<< v << " is not found"<< endl;
       }
       else
       {
           Node * temp = new Node;
           temp->val = v;
           temp = hashTable[index];
           int j = 0;
           while(temp != NULL)
           {
               if (temp->val == v)
               {
                   cout<< v << " is found at "<< index <<" , " << j << endl;
                   break;
               }
               j++;
               temp = temp ->next;

           }
           if(temp == NULL)
           {
               cout<< v << " is not found" << endl;
           }
       }
    }

    void display()
    {
      for(int i=0;i<SIZE;i++)
      {
          cout<<i<<"-->";
          if(hashTable[i] != NULL)
          {
              Node* temp=new Node;
              temp=hashTable[i];
              while(temp != NULL)
              {
                  cout<<temp->val<<"-->";
                  temp=temp->next;
              }
          }
          cout<<"\n";
      }

    }
};

int main()
{
    LinkedList l1;

    l1.init(10);

    l1.insertValue(22);
    l1.insertValue(32);
    l1.insertValue(21);
    l1.insertValue(25);
    l1.insertValue(27);

    l1.display();

    l1.searchValue(32);
    l1.searchValue(2);
}