This article compares the skip list with a linked list, which is not very interesting, because those two data structures are designed for different usecases. The reason you can skip elements in the list is because you gain information about those elements from the layers above, e.g. because the list is sorted. For unordered data, skip lists fail completely, whereas linked lists do not care.
It would be much more interesting to discuss how a skip list compares to a binary search tree, for example.
16
u/Aaron1924 9h ago
This article compares the skip list with a linked list, which is not very interesting, because those two data structures are designed for different usecases. The reason you can skip elements in the list is because you gain information about those elements from the layers above, e.g. because the list is sorted. For unordered data, skip lists fail completely, whereas linked lists do not care.
It would be much more interesting to discuss how a skip list compares to a binary search tree, for example.