Data Structures and Algorithms Lecture Notes

30 March 2011 • Heaps and Priority Queues


There is a name clash between a binary tree obeying the heap property and a blocks of programmer-allocatable storage made available via new and delete (for example). The former will be called a heap here and the latter dynamically-managed storage.
This page last modified on 2006 January 24.