Work in pairs on this lab.
Finish the implementation of the priority queue and all of its JUnit testing code. The current version of the code is here. Don't forget to test the combinations of adding and removing, as well as Iterable behavior.
Implement a priority heap by writing JUnit tests and then making them pass. Start with the code here. The book gives a description and a (slightly different) implementation of a heap on pp. 667-681, with helpful pictures.
Submit all your JUnit code and the implementation.
Submit the java file(s) with your testing code by e-mail to me. The subject of the message must be 2101 Lab 9. Make sure to CC your group partner.