Chapter 18, Problem 9E

Explanation of Solution

Method:

//define a static method

public static int kthSmallest(PriorityQueue<Integer> pq, int k) {

    //condition initialized to verify the value of "k"

    if (k <= 0 || k > pq.size()) {

        //throws exception

        throw new IllegalArgumentException();

    }

   //create an integer queue

    Queue<Integer> backup = new LinkedList<Integer>();

    //assign the value

    int size = pq.size();

    //declare the required variables

    int kth = 0;

    //loop initialized till the size of the queue

    for (int i = 0; i < size; i++) {

       //remove the elements

        int n = pq.remove();

        //condition initialized to verify the value of "i"

        if (i == k - 1) {

            //assign the value

            kth = n;

        }

       //add the values

        backup...