heapDriver.m

h=Heap([1 2 3 4 5 6 7 8])

mx=h.heapMaximum
heapExtractMax(h)
heapIncreaseKey(h,3,11)
maxHeapInsert(h,1.5);

b=heapSort(h);