Trees on Data Structure and Algorithms related Questions and Answers


Question :   Prim's algorithm can be efficiently implemented using _____ for graphs with greater density.
1. d-ary heap
2. linear search
3. fibonacci heap
4. binary search
Answer :   1 - d-ary heap  

* 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