Consider the following Java code snippet:    

Solution

When a PriorityQueue is initialized with a Collection (like numbers list here), it performs a "heapify" operation. This operation builds a min-heap (by default) from the given elements. The time complexity for building a heap from N elements is O(N).     1.  List numbers = Arrays.asList(7, 2, 9, 1, 5);     2.  PriorityQueue pq = new PriorityQueue<>(numbers);         The PriorityQueue is constructed and heapified. The elements will be arranged such that the smallest element is at the root. The conceptual order of elements in the min-heap will be {1, 2, 5, 7, 9}.     3.  System.out.println(pq.poll());         Removes and prints the smallest element: 1. Heap: {2, 5, 7, 9}.     4.  System.out.println(pq.poll());         Removes and prints the next smallest element: 2. Heap: {5, 7, 9}.     5.  System.out.println(pq.poll());         Removes and prints the next smallest element: 5. Heap: {7, 9}.     Therefore, the output is 1, 2, 5.