Test Index

GATE Computer Science (CS) 2015 Shift 2 Solved Paper

© examsnet.com

Question : 22

Total: 65

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

Ω (log n)
Ω (n)
Ω (n log n)
Ω (n²)

Go to Question:

Prev Question

Next Question