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
Answer:B
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