In c++, Implement a Priority Queue with a Binary HEAP. Use a Min Heap. Create a class called Node: Have a Name and Priority. Data set - 1 is the highest priority, 10 is lowest priority. Enqueue and dequeue in the following order. Function Name, Priority Enqueue Joe, 3 Enqueue Fred, 1 Enqueue Tuyet
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Algorithm:
Step1: Do while loop used to iterate till the user choose for quit.
Step2: Inside loop the switch case used to user choose the separate function to perform.
Step3: Select case 1 to insert the element in queue based of priority by insert() function. Condition checks that top value is null or not, if null then, insert value on top else read of next node and insert the element.
Step4: Select case 2 to delete the element in queue based on top priority. if top element is null, then queue is underflow.
Step5: Select case 3 to display the element in the queue to read every node and if the top is null, then display queue is empty.
Step6: Select case 4 to quit the program.
The solution is given in next step:
Step by step
Solved in 4 steps with 6 images
