PA of Algorithms Q70

0. Consider a complete binary tree where the left and the right subtrees of the root are maxheaps. The lower bound for the number of operations to convert the tree to a heap is

Answer
Comment
Array

Option : A
Explanation :
The subtrees are already Max-heap, so to make it half, we have to heap if the root, which takes Ω(log n) time.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.