The following is an incorrect diagram of the array representations of the heap shown in Self-Check Problem 17 using the array representation described in this section of the chapter (before any adds or removals are made from it). What is wrong with the diagram? What changes must be made to fix it so that it accurately represents the given heap?

Data from Self Problem 17

Simulate the adding of the value 21 to the following min-heap:

Transcribed Image Text:

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] 12 29 30 39 40 55 64 70 84 91 99