hashi_sepchaining.h

This is a binary search tree with void* pointer in data segment in order you to search store and del

/**Author jmanous..*/
/**A Little nice list with n complexity.Hope not so may SIGSEGV*/

#ifndef HASHI_SEPCHAINING_H
#define HASHI_SEPCHAINING_H
#include "single_list.h"


typedef struct {
     Node_sl *keyTable[50];
     int (*hashfun)(int);
     int keysize;
     int totalsize;
}hashTable;

hashTable *CreateNew_hs(void);

int Insert_hs (int id,int type,int size,hashTable *h);

Node_sl* Delete_hs(int id , hashTable* h);

Node_sl* Find_hs(int id , hashTable* h);

void print_hs(hashTable* h);

void merge_hs(Node_sl *array[], int p, int q, int r);

#endif