Hide text Hide pseudocode  
MinHeap is represented both as an array and binary tree. Before doing the exercise, study the following code example, and implement operations
Leftchildindex(i) and Rightchildindex(i) for this particular heap.
Perform DeleteMin, three times, and after each deletion, restore heap property.  
Algorithm 1 HeapExtractMin(A)
