(10 pts) Given the following min-heap implemented using an array:
(2)
/ \
(13) (7)
/ \ / \
(17) (14) (22) (8)
/
(21)
- Show what the heap looks like after deleting the minimum
element.
- Show what the heap looks like after inserting 15 into the original
heap.