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
The doubt is from Skip List in chapter Types of Lists of Data Structures & Algorithms I
This question was posed to me during a job interview.