CMSC-341, Spring 1999, Sections 101 and 201

Lecture Synopsis

13. Priority Queues

[Previous Lecture] [Next Lecture]

Priority Queue ADT
Implementations
- Array
- List
- Binary Heap
Heap Operations
- Insert
- Delete
- Heap Construction
  - Top-Down
  - Bottom-Up
Proof that heap construction is O(n)

[Previous Lecture] [Next Lecture]

Last modified on Tuesday April 6, 1999 (14:57:27 EDT) by Alan Baumgarten
email: abaumg1@cs.umbc.edu

Back up to Spring 1999 CMSC-341 Section 1 and 2 Homepage