Java: Change priorityQueue to maximum priorityqueue

Last update on March 12 2025 13:32:34 (UTC/GMT +8 hours)

Write a Java program to change priorityQueue to maximum priority queue.

Sample Solution:-

Java Code:

import java.util.*;
  public class Example12 {
  public static void main(String[] args) {
  PriorityQueue<Integer> pq1 = new PriorityQueue<>(10, Collections.reverseOrder());
      
   // Add numbers in the Queue
   pq1.add(10);
   pq1.add(22);
   pq1.add(36);
   pq1.add(25);
   pq1.add(16);
   pq1.add(70);
   pq1.add(82);
   pq1.add(89);
   pq1.add(14);
   System.out.println("\nOriginal Priority Queue: "+pq1);

System.out.print("\nMaximum Priority Queue: ");
Integer val = null;
while( (val = pq1.poll()) != null) {
    System.out.print(val+"  ");
      }
	  System.out.print("\n");
  }
}

Sample Output:

Original Priority Queue: [89, 82, 70, 25, 16, 22, 36, 10, 14]          
                                                                       
Maximum Priority Queue: 89  82  70  36  25  22  16  14  10

For more Practice: Solve these Related Problems:

• Write a Java program to convert a minimum PriorityQueue to a maximum PriorityQueue by providing a custom Comparator with Collections.reverseOrder().
• Write a Java program to create a PriorityQueue that behaves as a max-heap and then insert elements to verify the order.
• Write a Java program to implement a method that transforms a min-heap-based PriorityQueue into a max-heap by rebuilding it with a reversed comparator.
• Write a Java program to compare the behavior of a standard PriorityQueue with one constructed using reverse order, by printing both queues.

Java Code Editor:

Contribute your code and comments through Disqus.

Previous: Convert a Priority Queue elements to a string representation.
Next: Associate the specified value with the specified key in a HashMap.