circular_bst.h

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

#include "single_list.h"
typedef struct Node {
	int id;
	struct Node* p;
	struct Node* lc;
	struct Node* rc;
	struct Node_sl* DocL;
}Node_dt;

Node_dt* root;

unsigned int maxf; 

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

/*Insert a node with id */
int Insert_dt (int id);

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

/*Print Tree */
void print_dt(void);

/*Find the minimum node of the subtree with root node*/
Node_dt* findMin_dt(Node_dt* node);

/*Find the next element with id of the subtree with root node
  and store it at ret pointer*/
void findNextInorder_dt(Node_dt* node,Node_dt** ret, int id);

 /*insert file*/
int Insert_File(int id, int type);

/*Find a file*/
Node_sl* Find_File(int id);

int Delete_dtfinal(int id);