Heap is a complete binary tree-based data structure thatsatisfies heap property. Perform insert and delete simulation foreach given number below by using the concept of Min Heap and MaxHeap! Hence, there will two trees as your answer (i.e. min heaptree, max heap tree).
a. INSERT: +300, +500, +700, +600, +650, +550, +525, +510, +580,+200, +565, +800
b. DELETE: 5 elements *you are obligated to use predecessor(left subtree’s right-most child) for the replacement process
Expert Answer
An answer will be send to you shortly. . . . .