Chapter 20.10, Problem 20.10.3CP

Explanation of Solution

Priority Queue:

A PriorityQueue is a class which is used at that time of objects are processed depends on priority. It follows the queue format such as First-In-First-Out algorithm. However, sometime queue elements are processed according to priority. That is, it is based on priority heap.

Syntax to create object for PriorityQueue class:

PriorityQueue<dataType> objectName = new PriorityQueue<dataType>();

Syntax to create object for PriorityQueue class using Comparator in constructot:

PriorityQueue<dataType> objectName = new PriorityQueue<dataType>(InitialCapacity, comparator);

The default ordering for PriorityQueue elements is natural order or ordered by using the compareTo() method in Comparator interface...