Using an array to represent the min-max heap structure , implement the following operations. (in c++ programming language)

1. buildHeap : Builds a min-max heap from a list of naturals read from standard input.

2. findMin and findMax : Returns the minimum (resp the maximum) element.

3. insertHeap : Inserts a new element into the min-max heap.

4. deleteMin and deleteMax : Deletes the minimum (resp the maximum) element.

NOTE: min-max should be in one heap structure only and not separate heap structure for min and max. Only one heap for both min and max. Root should be min level, the level below root should be max level,then level after that should again be min level and so on.

Public Answer

IHBKQV The First Answerer