Computer scienceAlgorithms and Data StructuresAlgorithmsArray algorithmsSorting algorithms

Heapsort

Theory

Heapify

Report a typo

We have given you an Array, AA:

Array

Perform the following operations in the given order on a max-heap:

  1. HEAPIFY(A, 4)

  2. HEAPIFY(A, 2)

  3. HEAPIFY(A, 1)

What is the value of A[2]A[2] after these operations?

Tip: To assist in your calculations, you may find it helpful to draw the heap on paper.

Enter a number
___

Create a free account to access the full topic