Heapsort (13)

Step 2. Now perform n successive DELETEMIN operations. After each one, store the deleted element in the array space freed up at the end of the current tree...

Previous slide

Next slide

Back to first slide

View graphic version