Java: Compare two priority queues

Last update on May 22 2025 13:15:35 (UTC/GMT +8 hours)

7. Compare PriorityQueues

Write a Java program to compare two priority queues.

Sample Solution:-

Java Code:

import java.util.PriorityQueue;
  public class Exercise7 {
  public static void main(String[] args) {
  // Create a empty Priority Queue
        PriorityQueue<String> pq1 = new PriorityQueue<String>();  
     // use add() method to add values in the Priority Queue
          pq1.add("Red");
          pq1.add("Green");
          pq1.add("Black");
          pq1.add("White");
          System.out.println("First Priority Queue: "+pq1);
          PriorityQueue<String> pq2 = new PriorityQueue<String>();  
          pq2.add("Red");
          pq2.add("Pink");
          pq2.add("Black");
          pq2.add("Orange");
          System.out.println("Second Priority Queue: "+pq2);
          //comparison output in Priority Queue
         for (String element : pq1){
             System.out.println(pq2.contains(element) ? "Yes" : "No");
          }      
     }
}

Sample Output:

First Priority Queue: [Black, Red, Green, White]                       
Second Priority Queue: [Black, Orange, Pink, Red]                      
Yes                                                                    
Yes                                                                    
No                                                                     
No

For more Practice: Solve these Related Problems:

Write a Java program to compare two PriorityQueues for equality by converting them to arrays and comparing element by element.
Write a Java program to use Java streams to zip two PriorityQueues and check if all corresponding elements are equal.
Write a Java program to implement a custom method that compares the sizes and elements of two PriorityQueues and returns a boolean result.
Write a Java program to merge two PriorityQueues and then compare the merged queue with one of the originals to check for subset relations.

Go to:

PREV : Count PriorityQueue Elements.
NEXT : Peek First PriorityQueue Element.

Java Code Editor:

Contribute your code and comments through Disqus.