Question
C++(Screenshot of output) Program 3 Implement a Priority Queue with a Binary HEAP. Use a Max Heap. Data for Programs 1, 2 and 3 Create
C++(Screenshot of output)
Program 3 Implement a Priority Queue with a Binary HEAP. Use a Max Heap.
Data for Programs 1, 2 and 3
Create a class called Node: Have a Name and Priority.
Data set - 10 is the highest priority, 1 is lowest priority.
Enqueue and dequeue in the following order.
Function Name, Priority
Enqueue Joe, 3
Enqueue Fred, 1
Enqueue Tuyet, 9
Enqueue Jose, 6
Dequeue
Enqueue Jing, 2
Enqueue Xi, 5
Enqueue Moe, 3
Dequeue
Enqueue Miko, 7
Enqueue Vlady, 8
Enqueue Frank, 9
Enqueue Anny, 3
Dequeue
Enqueue Xi, 2
Enqueue Wali, 2
Enqueue xChe, 6
Enqueue xVerra, 8
Dequeue
Dequeue
Dequeue
Dequeue
Dequeue
Dequeue
Dequeue
Dequeue
Dequeue
Dequeue
Dequeue
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started