Consider the following array:

Suppose the array represents a Complete Binary Tree $($CBT$).$ Convert the CBT into a min$-$heap by applying

bottom$-$up heap construction as discussed in lectures and detailed in the Bottom$-$Up Heap Pseudocode.

Place the expected array in the answer$()$ function below. You response should follow this format

$1,2,3,4$

Hint: Draw the CBT$,$ perform the operations, then convert the result back to an array.

NOTE: You have $3$ tries with no penalty. After the third try you lose $0\mathrm{.}33$ of the points.

Respuesta: $($sistema de penalizaci$$n: $0,0,0,33,$dots$\%)$

Reiniciar respuesta