Algorithms and OOD (CSC 207 2014F) : Outlines

Outline 49: Heaps


Held: Monday, 1 December 2014

Back to Outline 48 - Hash Tables, Continued. On to Outline 50 - Heap Sort.

Summary

We explore heaps, a useful and relatively efficient implementation of priority queues.

Related Pages

Overview

Administrivia

Upcoming Work

Extra Credit

Academic

Peer Support

Presentation Prep

Priority Queues, Reviewed

Implementation Techniques

Heaps

Adding Elements

Removing Elements

Using Arrays

Heap Sort