Heap on Data Structure and Algorithms related Questions and Answers


Question :   What is the worst case time in searching minimum value in weak -heap?
1. O(log n)
2. O(n)
3. O(n logn)
4. O(1)
Answer :   4 - O(1)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter