Q65
To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
A.
balanced binary search trees
AnswerB.
binary search trees
C.
binary trees
D.
linked lists
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board