IMPLEMENTATION OF THE SKIP LIST DATA STRUCTURE WITH IT'S UPDATE OPERATIONS
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....
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Education for Women
2019-02-01
|
| Series: | مجلة كلية التربية للبنات |
| Online Access: | http://jcoeduw.uobaghdad.edu.iq/index.php/journal/article/view/1054 |
| Summary: | 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 upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.
|
|---|---|
| ISSN: | 1680-8738 2663-547X |