Skip lists are similar to which of the following datastructure?

Skip lists are similar to which of the following datastructure? Correct Answer balanced binary search tree

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

Related Questions

To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
Given 10,8,6,7,9 swap the above numbers such that finally you got 6,7,8,9,10 so now reverse 10 9,7,6,8,10 now reverse 9 8,6,7,9,10 7,6,8,9,10 6,7,8,9,10 at this point 6 is ahead so no more reversing can be done so stop. To implement above algorithm which datastructure is better and why ?
Group I lists spectroscopic methods and Group II lists bimolecular applications of these methods. Match the methods in Group I with the applications in Group II.
Two lists are given below. Match both the lists and choose the correct answer:
In the two lists given below, List I provides the list of Treaties, while List II indicates Years. Match the two lists and choose the correct answer:
In the two lists given below, List I provides the list of Prime Ministers, while List II indicates Governments. Match the two lists and choose the correct answer: