Data Structures & Algorithms Lecture Notes
17 November 2010 • 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
Left child: 2
i
.
Right child: 2
i
+ 1.
This page last modified on 24 January 2006.