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