Question

please be accurate, make sure that the answer is correct and explain each step.

Draw the min-heap that results from the bottom-up heap construction algorithm on the following
list of values: 10, 17, 15, 25, 40, 19, 45, 16, 12, 8, 18, 14, 13, 9, 20, 11, 13

Starting from the bottom layer, use the values from left to right as specified above.

Show immediate steps and the final tree representing the min-heap.

Afterwards perform the operation removeMin 3 times and show the resulting min-heap after each step.

Answer 1

solution:

now remove 3 min values

here 8 is the min value so

remove 8

after removing 8 tree is like this

and next min is 9

so remove 9

then tree is like this

and the next min value is 10

so remove 10

AFTER REMOVING 10 THE TREE IS LIKE THIS

NOTE:

DEAR SIR IF YOU HAVE ANY DOUBTS ASK IN COMMENT SECTION I WILL EXPLAIN YOU

PLEASE DONT DISLIKE

IF YOU UNDERSTAND THE MY ANSWER PLEASE GIVE ME UP VOTE:)