Be careful in changing links in a doubly-linked list. Making changes in the wrong order may result in dangling pointers and marooned sections of the list.

Write a driver program to test the priority queue class template in Exercise 1.

Exercise 1

In Section 8.4, 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 Pri ori tyQueue 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

In Section 8.4, 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 Pri ori tyQueue class template. You should also test your class template as instructed in Programming Problem 1 at the end of this chapter.