Question

Write a program in Java to implement the min-priority queue using min-heap data structure. Implement the min-heap data structure using a String array of 5 cells. (Do not use Java in-built PriorityQueue class.) [In a min-heap, the root node and the intermediate node vales are always smaller than their children.] First, take 5 names from the user and insert them in the min-priority queue. Then print the elements of the queue. After that, delete two elements from the queue and print them. You can use Java Scanner class to take inputs from the user. The sample inputs/ outputs are given below:

Sample inputs and outputs:

(User's inputs are shown in bold)

Enter 5 names: Harris, Eve, Alice, Bob, Eva The elements of the min-priority queue: Alice, Bob, Eve, Harris, Eva The name removed after first deletion: Alice The name removed after second deletion: Bob The elements of the min-priority queue: Eva, Harris, Eve