[Solved] Skip lists are similar to which of the following data structure?

Skip lists are similar to which of the following data structure?

a) stack
b) heap
c) binary search tree
d) balanced binary search tree

Answer: d
Explanation: Skip lists have the same asymptotic time complexity as balanced binary search trees. For a Balanced Binary Search Tree, we skip almost half of the nodes after one comparison with the root element. The same thing was done in the skip lists. Hence skip lists are similar to balanced Binary search trees.

Comments