Lecture 31

Learning objectives

After this class, you should be able to:

1. Write code using the STLpriority_queue.

Reading assignment

1. Section 6, section 6.9.
2. Lecture: Priority queues.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Insert the following element into an STL priority_queue: 16 14 10 8 7 9 3 2 4 1, with a function object to make it a min-heap. Then output all the elements of this heap in sorted order.

• Questions on next lecture's material
  1. None.

---

Last modified: 14 Nov 2011