Modify the HeapIntPriorityQueue class written in this chapter to make it configurable in ways similar to Javas

Question:

Modify the HeapIntPriorityQueue class written in this chapter to make it configurable in ways similar to Java’s PriorityQueue class. Make it possible for the heap to be a min-heap or max-heap. (If you create a heap of objects, you could also modify it to accept a Comparator parameter to its constructor.)

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  answer-question
Question Posted: