題組內容

4. The array A shown below is used to represent the complete binary tree.
62f4bad23f088.jpg Please answer the following three questions:

(3) [15 points] Perform the following three heap operations sequentially: INSERT (18), INSERT (27) , DELETE on T. Draw the resultant tree after each operation.