main2.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 "priority_queue.h"

int main (void){
	priorQueue *q = newHeap(200);
	heapInfo i;
	/*i.timeStamp = 255;
	Insert(&i,q);
	i.timeStamp = 4;
	Insert(&i,q);
	i.timeStamp = 3;
	Insert(&i,q);
	i.timeStamp = 13;
	Insert(&i,q);
	i.timeStamp = 6;
	Insert(&i,q);
	i.timeStamp = 25;
	Insert(&i,q);
	i.timeStamp = 2;
	Insert(&i,q);
	i.timeStamp = 15;
	Insert(&i,q);
	i.timeStamp = 5;
	Insert(&i,q);
	i.timeStamp = 7;
	Insert(&i,q);
	i.timeStamp = 20;
	Insert(&i,q);
	i.timeStamp = 19;
	Insert(&i,q);
	i.timeStamp = 1;
	Insert(&i,q);*/
	
	int j,r;
	for (j = 0;j<200;j++) {
	  r = rand();
	  heapInfo h;
	  h.timeStamp = r;
	  Insert(&h,q);
	}
	printall(q);
	
	int c;
	while( c=getchar()) {
	  heapInfo *m = DeleteMin(q);
	  printf("MIN IS %d\n",m->timeStamp);
	}
	
	heapInfo *m = getMin(q);
	printf("MIN IS %d\n",m->timeStamp);
}