Skip List | Set 1 (Introduction) Can we search in a sorted linked list in better than O(n) time? 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. Can we augment sorted linked lists to make the search faster? The answer is Skip List . The idea is simple, we create multiple layers so that we can skip some nodes.
Read full article from Skip List | Set 1 (Introduction) | GeeksforGeeks
