Question 8231 – Heap-Tree

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

Correct Answer: A

Question 7 Explanation:

Since left and right subtree is already a heap. So we can apply Heapify (node) which take log n time.

Ω(logn)

Ω(n)

Ω(nlog n)

Ω(n²)

0 0 votes

Article Rating

0 Comments

Inline Feedbacks

View all comments