Data Structures & Algorithms Lecture Notes

3 December 2009 • Heaps and Priority Queues


Sometimes it may be more convenient to store the root at index 1 and use index 0 to keep track of the number of nodes in the tree. In this case, the indexing is


This page last modified on 24 January 2006.