Skip List | Set 1 (Introduction)

The worst case search time for a sorted linked list is O(n) as we can only linearly traverse the list and cannot skip nodes while searching. For a Balanced Binary Search Tree, we skip almost half of the nodes after one comparison with root. For a sorted array, we have random access and we can apply Binary Search on arrays.

Skip List  Set 1 (Introduction) : https://www.geeksforgeeks.org/skip-list/