Consider a complete binary tree where the left and the right subtrees of the…
PYQ GATE 2015
Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is
- A.
- B.
- C.
- D.
Attempted by 805 students.
Sign up free to check your answer
Sign up freeLoading lesson…

