Implement a priority queue class based on the max-heap class implementation. The following methods should be supported for manipulating the priority queue: • void enqueue(int ObjectID, int priority); • int dequeue(); • void changepriority(int ObjectID, int newPriority); Method enqueue inserts a new object into the priority queue with ID number ObjectID and priority. Method dequeue removes the object with highest priority from the priority queue and returns its object ID. Method changepriority changes the priority of the object with ID number ObjectID to be new Priority. The type for element should be a class that stores the object ID and the priority for that object. You will need a mechanism for finding the position of the desired object within the heap. Use an array, storing the object with ObjectID i in position i.

Answer rating: 100% (QA)

implementation of a priority queue class based on the maxheap class is as follow The following code ... View the full answer