+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...