previous
|
index
|
next
An Array Implementation of Binary Heaps
Allocate an array
A
to hold the maximum number of nodes in a binary heap.
Store the root of the heap in index location
1
(location
zero
is not used):
previous
|
index
|
next