To which datastructure are skip lists similar to in terms of time complexities in worst and best cases? - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
01 Apr 2019 10:24 AM study24x7 study24x7

To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?

A

balanced binary search trees

B

binary search trees

C

binary trees

D

linked lists

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles