Heap on Data Structure and Algorithms related Questions and Answers


Question :   What is the run time efficiency of an insertion algorithm in d-heap?
1. O(N)
2. O(log N)
3. O(logd N)
4. O(Nd)
Answer :   3 - O(logd N)  

* 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