Assume the initial the following max$-$heap

$8$

$/1$

$4\}$

$/\backslash$

$12$

Then we inserted $10$ below $5$

$8$

$/1$

$45$

$/\backslash /$

$1210$

Show the steps of returning the properties of max$-$

heap.

what if we delete the $10?$ How would we return to

the original max$-$heap?

The maximum item in a max$-$heap is always the

$.$ The complexity of finding the maximum item is

thus O$(?)$

If the index of the current element is I, establish the

max$-$heap algorithm

Miniproject $($programming$)$: use Max$-$heap for

Priority queue $($ER in hospitals$).$ Critically analyze the

outcomes by example.