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...
Want to see the full answer?
Check out a sample textbook solutionChapter 18 Solutions
BUILDING JAVA PROGRAMS-TEXT
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education