What is the worst case time in searching minimum value in weak -heap?

Category: QuestionsWhat is the worst case time in searching minimum value in weak -heap?
Editor">Editor Staff asked 1 month ago

What is the worst case time in searching minimum value in weak -heap?
 
(a) O(log n)
 
(b) O(n)
 
(c) O(n logn)
 
(d) O(1)
 
This intriguing question comes from Weak Heap topic in portion Heap of Data Structures & Algorithms I
 
The question was posed to me in examination.

1 Answers
Editor">Editor Staff answered 1 month ago

The correct choice is (d) O(1)
 
Easy explanation – Weak heap is an array based form that supports the operation of finding a minimum in O(1).