GATE Computer Science (CS) 2015 Shift 2 Solved Paper

Question : 22 of 65

Marks: +1, -0

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