Question #$1$:

$(8$ Points$)$

a$)$ Construct a balanced max$-$heap $($i$.$e$.$ a heap that always returns the maximum element$)$ using the following elements, pushing them onto the heap in the given order: $7,2,1,9,12,3,14$ Draw the heap after each completed insertion of an element.

$(2$ Points$)$Question #$1$:

$(8$ Points$)$

a$)$ Construct a balanced max$-$heap $($i$.$e$.$ a heap that always returns the maximum element$)$ using the following elements, pushing them onto the heap in the given order: $7,2,1,9,12,3,14$ Draw the heap after each completed insertion of an element.

$(2$ Points$)$