Adaptable Priority Queue
$30-250 USD
Paid on delivery
Please complete the AdaptablePriorityQueue class from the attached file by providing an implementation of the removeMin, remove, replaceKey, and replaceValue methods, which are currently just stubs. I have already implemented the insert method. The class itself implements an Adaptable Priority Queue, using an ArrayList to store the entries as a Binary Heap. In comments, I have stated the behavior that is expected of the methods you will implement.
The implementations of the new methods should run in O(log n) time, where n is the number of entries in the priority queue. This will be using a binary heap.
Project ID: #1300404