Building the Heap
Insert(NewKey) {
if (NumElements=MaxElements) return false
NumElement++
HeapArray[NumElements]= NewKey
int k=NumElements; int parent;
while (kɭ)
{ parent=k/2
if (Compare(k, parent) >= 0) break;
else Exchange(k, parent);
k=parent}
Return true}
Previous slide
Next slide
Back to first slide
View graphic version