Lists on Data Structure and Algorithms related Questions and Answers


Question :   To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
1. balanced binary search trees
2. binary search trees
3. binary trees
4. linked lists
Answer :   1 - balanced binary search trees  

* 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