Miami University Heap Priority Queue Java Project

For this lab you will be creating the HeapPriorityQueue.java class. Watch the video on PriorityQueueUsingHeap that we did during lecture on Monday or I’ll be uploading a YouTube version later today.

Note: this lab does not give you much. You are to become more independent on developing this type of program. Make sure you use good coding practices and work through all of the methods from the interface. Remember that a this queue can grow by doubling the array size (no need to move to the next prime number)

Include a toString() that returns the following format: [null, #, #, #, …]

Only turn in your HeapPriorityQueue.java

You are to create a PriorityQueueUsingHeap.java class that uses an array to keep track of your heap data. Include the following interface:

public interface PriorityQueueInterface<T extends Comparable<? super T>> {
      boolean isEmpty();
      void clear();
      int size();
      void add(T newEntry);
      T peek();// returns null if empty (gets highest object)
      T remove();// throws NoSuchElementException if empty (get and remove highest obj)
}