15-122 Principles of Imperative Computation
Lecture 15: Priority Queues

• Reading: 15-priorqs.pdf
• Code: (from lecture 16) heaps.c0, code directory
• Concepts:
  • Priority queues
  • Heaps
  • Ordering Invariant
  • Shape Invariant
  • Full binary trees as arrays
• Previous lecture: Interfaces
• Next lecture: Restoring Invariants

[ Home | Schedule | Assignments | Resources ]
[ Blackboard | academic.cs.15-122 ]

fp@cs
Frank Pfenning