Chapter 17, Problem 27RE

Explanation of Solution

Heap in an array:

The element of the heap are stored in the array level by level that is the elements of the first level are inserted from left to right first in the array then the with the second level of the tree and so on.

Consider the below heap:

The above heap is represented in the array format as shown below:

19

70

43

80

87

56

69

96

91

93

• From the above the element 19 is present at the level 1 of the heap and it is considered as the first element of the heap, the array index will be 1.
• will be the left child of the root and is present at the second level of the heap, the array index will be 2.
• From the above points it is clear that child nodes of the heap node present in the array is with index i have index 2*i and where i is the index of the parent...