An array of integers of size n can be converted into a heap by adjusting the…
PYQ GATE 2004
An array of integers of size n can be converted into a heap by adjusting the heaps rooted at each internal node of the complete binary tree starting at the node ⌊(n - 1) /2⌋, and doing this adjustment up to the root node (root node is at index 0) in the order ⌊(n - 1)/2⌋, ⌊(n - 3)/ 2⌋, ....., 0. The time required to construct a heap in this manner is
- A.
O(log n)
- B.
O(n)
- C.
O (n log log n)
- D.
O(n log n)
Attempted by 485 students.
Sign up free to check your answer
Sign up freeLoading lesson…

