priority_queue.h

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

#ifndef PRIORITY_QUEUE
#define PRIORITY_QUEUE
typedef struct  {
	int actionType;
	int timeStamp;
	int id;
	int type;
}heapInfo;

typedef struct  {
	heapInfo *heap;
	unsigned int maxSize;
	unsigned int size;
}priorQueue;

/*makes a new priority queue with fixed size(?)*/
priorQueue* newHeap(unsigned int qsize);

/*inserts a new sceduled action in the priority
  queue pointed by heapInfo* */
int Insert(heapInfo *newAction,priorQueue *p);

/*Gets the action with the highest priority*/
heapInfo* getMin(priorQueue *p);

/*Deletes and gets the action with the highest priority*/
heapInfo* DeleteMin(priorQueue *p);

void printall(priorQueue *p);
#endif