Implementation of the skip list data structure with it's update operations

Abstract EN

A skip list data structure is really just a simulation of a binary search tree.

Skip lists algorithm are simpler, faster and use less space.

This data structure conceptually uses parallel sorted linked lists.

Searching in a skip list is more difficult than searching in a regular sorted linked list.

Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers.

The implementation of the search, insert and delete operation taking a time of up to.

The skip list could be modified to implement the order statistic operations of RANK and SEARCH BY RANK while maintaining the same expected time.