Algorithms and OOD (CSC 207 2014S) : Outlines

Outline 45: Heaps

Held: Monday, 21 April 2014

Back to Outline 44 - Hash Tables, Continued. On to Outline 46 - Pause for Breath.


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

Related Pages



Upcoming Work


Extra Credit

Priority Queues, Reviewed

Implementation Techniques


Adding Elements

Removing Elements

Using Arrays

Heap Sort

Copyright (c) 2013-14 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.