Heap Sort

1. What is the time complexity of the operation to remove the root?

a: O(1) b: O(n) c: O(logn) d: Insufficient information

2. How many operations will be present to remove the root if there are 10 elements in an array?

a: 1 b: 5 c: 10 d: 20