Fetch min elements without violating heap property

#1

Write a program that fetches the minimum elements and sorts them in non-decreasing order from
binary max-heap (H). Make sure the heap property of the binary max-heap(H) will not be violated throughout the process.

#2

Hello @sch what is your doubt in this? please mention that as well?