Session Details

Week 7, Session 20 — Wed Jan 27

Preparation

  1. § 21.1-21.3

Due

Topics

  1. Priority Queues and Binary heaps
  2. Heaps work time

Outline

  1. [10 min] Priority Queue ADT
  2. [10 min] Priority Queue implementations using already-studied data structures
  3. [50 min] Binary heaps
  4. [5 min] Break
  5. [30 min] Heaps work time

Resources

  1. Slides
  2. Heaps and heapsort assignment
  3. Heap animation

HW Assigned

  1. See Preparation, Due, and Major Programs columns on the main schedule page