Lecture 29

Learning objectives

After this class, you should be able to:

1. Given a sequence of insertions and DeleteMin operations on a min heap, draw the resulting heap.
2. Give the time complexity for deletion from a heap.

Reading assignment

1. Section 6, up to section 6.3.3.
2. Lecture: Priority queues.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Draw the max heap corresponding to the following array: 16 14 10 8 7 9 3 2 4 1 and show the heap that results after a DeleteMax operation.
  2. Derive the average case time complexity for DeleteMin. What assumption did you make regarding the inserted element?

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

---

Last modified: 9 Nov 2011