circular_dlist.h

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

typedef struct Node {
	int id;
	struct Node* next;
	struct Node* prev;
	struct Node_sl* DocL;
}Node_dl;

unsigned int maxf; 

/*Call this to get a new Head*/
Node_dl *CreateNew_dl(int id,int m);

/*Insert a node with id o(n) because all list will be scanned
	for duplicates*/
int Insert_dl (int id);

/*	Delete a Node by id. O(n)
	Deleting last Node in a list will cause list to be also 
	deleted.So you have to re-create it.*/
int Delete_dl(int id);

/*Try find the Node with id.If not present, return Null*/
Node_dl *Find_dl(int id);

/*Print list from head Node..(Or anything else xD);*/
void print_dl(void);
 
 /*insert file*/
int Insert_File(int id, int type) ;

/*Delete file*/
int Delete_File(int id) ;

int Find_File(int id) ;