Test

Exercise 4.9

Validate or refute the following statements:

• A table with its elements sorted from lowest to highest is a min-heap.

• Inserting in a max-heap with n elements has cost \Theta(\log n) in the worst case scenario.

• Finding the largest element in a min-heap has cost O(\sqrt{n}).

Extra

Is it true that eliminating the maximum element of a max-heap with n different elements has cost \Theta(1) in the best case?