MinHeap is represented both as an array and binary tree. Before doing the exercise, study the following code example, and implement operations Left-child-index(i) and Right-child-index(i) for this particular heap.
Perform DeleteMin, three times, and after each deletion, restore heap property.
For each record stored into heap you can see a key that corresponds to the priority. Delete button will remove a key. In addition, by drag & dropping a key on top of another one, you can swap the records.