Question

It's C++ language questions, but answer in drawing circle.
Please draw in paint:

Given an array
int alt = {100, 50, 10, 7, 6, 4, 1}
-Construct Max Heap
-Remove all nodes and after each removal sort heap back to max heap

Thanks

Answer 1

heap deletion happens from the root and it is replaced with the last element of the heap. then do heapify and swap depending on whether the value at the root is bigger or not

50 Le 7) (6 -to with laat elument | S6 to Ne. Remove next- geBot node , swap nith lp、 3) Remove lo ick max Ramove 6

) Remove 6,repplacs uitt No need of hdap