9.) Priority Queue (basic)

 Write a programme to find largest element in a priority queue.

import java.util.*;

public class PriorityQueueExample {

    public static void main(String[] args) {

        PriorityQueue<Integer> priorityQueue = new PriorityQueue<>(Collections.reverseOrder());

        priorityQueue.add(10);

        priorityQueue.add(20);

        priorityQueue.add(30);

        priorityQueue.add(40);

        Integer largestElement = priorityQueue.peek();

        System.out.println("Largest element in priority queue: " + largestElement);

    }

}