Data Structures and Algorithms

Exercise 1. Using your previous labs' implementation of heap data structure, write an implementation for priority queue ADT by using a heap with the following public functions:

//Create an object of priority queue class from a file where all space-
//separated integers are shown on the first line.
PriQueue(char *filename);

//Insert a value into the priority queue, and return true if successfully,
//otherwise return false.
void insert(int value);

//Delete and return the highest priority value (smallest).
int removeMin();