In a binary max heap containing n numbers, the smallest element can be found in time
A
Θ(logn)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Θ(n)
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
Θ(loglogn)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
Θ(1)
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is BΘ(n)
MAX Heap used to identify max element in O(1) time but to identify min element O(n) time will be required to apply the linear search.