Previous Lecture

lect15 Before Slides

lect15 Annotated Slides

Next Lecture

Topics

• Two different views of the heap : tree and array
• Operations supported by heaps
• Under the hood of heaps: min (or max), insert, delete min (or delete max)
• Applications for fast sorting