Algorithms and OOD (CSC 207 2013F) : Outlines

Outline 49: Heaps

Held: Monday, 2 December 2013

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


We explore heaps, an alternate implementation of priority queues.

Related Pages



Priority Queues, Reviewed

Implementation Techniques


Adding Elements

Removing Elements

Using Arrays

Heap Sort

Copyright (c) 2013 Samuel A. Rebelsky.

Creative Commons License

This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.