I'm studying heap sort and was presented with the following question.
What is the minimum number of items that must be exchanged during a remove the maximum operation in a heap of size N? Give a heap of size 15 for which the minimum is achieved.
There should be at minimum two sorts for this problem which I understand. However, I have trouble figuring out the answer for the second part of the problem,
Answer the same questions for two and three successive remove the maximum operations.
Would the answer also be 2 because the same process is taking place in which we find the child with the bigger key and see if the child needs to be promoted?