main3.c

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

#include <stdio.h>
#include <stdlib.h>
#include "circular_bst.h"

int main (void){
// 	CreateNew_dt(0xFFFFFFFF/2,5);
	Insert_dt(12);
	Insert_dt(15);
	Insert_dt(1);
	Insert_dt(125);
	Insert_dt(200);
 	Insert_dt(60);
	Insert_dt(115);
	Insert_dt(100);
      	
//        	Delete_dt(115);
      	
// 	findNextInorder_dt(root,115);
	
// 	Insert_File(99,3);
// 	Insert_File(102,3);
//  	Insert_File(25,3);
//  	Insert_File(116,3);
//  	Insert_File(220,3);
  /*	Delete_dt(3);
  	Delete_dt(4);
//   	Delete_dt(115);
	Delete_dt(2);*/	
/*
	Delete_File(102);
	Insert_dt(30);*/
 	int i=0;
  	for(i=0;i<20;i++){
  	  Insert_File(rand()/10000000,3);
  	}
	print_dt();
	Delete_dtfinal(200);
	print_dt();
	Delete_dtfinal(1);
	print_dt();
	Insert_dt(1);
	print_dt();
	Insert_dt(200);
	Delete_File(204);
	Insert_File(204,1);
	Delete_dtfinal(1);
	Delete_dtfinal(12);
	Delete_dtfinal(15);
	Delete_dtfinal(60);
	Delete_dtfinal(115);
	Delete_dtfinal(125);
	Delete_dtfinal(200);
	Delete_File(102);
	Insert_dt(60);
	Insert_dt(150);
	print_dt();
	
}