Heap Sort
1. What is the time complexity of removing the root from a heap when the heap property must be restored afterward?
2. How many root-removal operations are required to remove all 10 elements from a heap if one element is removed at each operation?
3. After removing the root from a binary heap, which element is typically moved to the root position before the heap property is restored?
4. In a max-heap, which element is obtained when the root is removed?
5. What is the purpose of restoring the heap property after removing the root?
6. If a heap contains elements, what is the height of the heap in terms of ?
7. During repeated root removals in Heap Sort with a max-heap, where is the removed maximum element placed in the array?
8. Which heap operation is primarily used to restore a heap after its root has been replaced?
9. If each root removal from a binary heap takes time and elements are removed, what is the overall order of the repeated removals?