Use an array to store a heap of n elements (which is an almost complete binary tree).
Perform the following operations on the heap:
(1) Insert an element at the (n+1)- th position
(2) Delete an element from a specified index

At the end of either operation, the augmented structure should be a heap.
Available from: Monday, 2 March 2009, 10:00 AM
Due date: Monday, 9 March 2009, 10:00 AM