Question

1. Which of the following list(s) is (are) not max-heap based on MaxHeapify algorithm?

Left(i)

return i*2

Right(i)

          return i*2 + 1

MaxHeapify(int[] A, int i){

l = Left(i);

            r = Right(i);

            largest = Integer.MIN_VALUE;                  

            if((l<A.heap-size) && (A[l] > A[i]))

                        largest = l;

            else

                        largest = i;

            if((r<A.heap-size) && (A[r] > A[largest]))

                        largest = r;

          if (largest != i){

              swap A[largest] with A[i]

                        maxHeapify(A, largest);

                        }

            }

which one is right ???

A = {23, 17, 14, 16, 12, 10, 13, 11, 15}
A = {56, 45, 20, 44, 30, 10, 15, 39, 40}
A = {56, 23, 50, 20, 18, 45, 49, 19, 17}
A = {58, 30, 48, 25, 18, 45, 49, 19, 17}
None of the above

Answer 1

Consider option 4

Children of node 48 are 45 and 49.

As 48 < 49 it is not a max heap.

A = {58, 30, 48, 25, 18, 45, 49, 19, 17}