Chapter 18.2, Problem 26SCP

Explanation of Solution

Min-heap:

• A Min-heap is known as a complete binary tree in which the value present in each internal node is smaller than or equal to the values in the children of the respective node.
• In this case, mapping the elements of a heap into an array is trivial.
• Example:
  • If a node is stored an index “k”, then its left child is stored at index “2k+1” and its right child at index “2k+2”.
• In this case, the heap is initially empty and the values 11,9,12,14,3,15,7,8, and 1 are to be added to the empty heap.
• Therefore, after adding 11,9,12,14,3,15,7,8, and 1 to the heap the result is: