Askmeabout

Lets share our knowledge

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

Q & A › Category: Data Structure › To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
0 Vote Up Vote Down
Admin Staff asked 4 years ago

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

1 Answers
0 Vote Up Vote Down
Admin Staff answered 4 years ago

a) balanced binary search trees