engineering recuitment UKPSC Polytechnic Lecturer Mock Test 2024 Algorithms Searching, Sorting and Hashing Sorting
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
1
Ω (log n)
2
Ω (n)
3
Ω (n log n)
4
Ω (n2)