Write a driver program to test the priority queue class template in Exercise 1.
Exercise 1,
In Section, a priority queue was described as a queue-like structure in which each item has a certain priority and is inserted ahead of all items with a lower priority; normally, it is placed behind all those with an equal or higher priority.
Assuming that such a priority queue is implemented as a linked list, develop a Priori queue class template. You should also test your class template as instructed in Programming Problem 1 at the end of this chapter.
Problem 1,
Write a driver program to test the priority queue class template in Exercise 1.
Exercise 1,
Beginning with the multiply-ordered linked list of names and id numbers pictured in the text, show the linked list that results from each of the operations or sequence of operations.
Insert Brown with id number 2250.