Question :
a) Show the results of inserting 10, 12, 1, 14, 6, 5, 8, 15, 3, 9, 7, 4, 11, 13, and 2, one at a into an initially empty binary heap. Show the tree at each stage.
b) Show the result of performing three DeleteMin operations in the heap of (a). Show work.