- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Implementation of the skip list data structure with it's update operations | ||
| JOURNAL OF THE COLLEGE OF EDUCATION FOR WOMEN | ||
| Article 1, Volume 24, Issue 2, 2013, Pages 586-592 | ||
| Author | ||
| Maha shakir Ibrahim | ||
| Abstract | ||
| 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 RANK and SEARCH BY RANK while maintaining the same expected time. | ||
| Keywords | ||
| skip list; parallel linked list; randomized algorithm; Rank | ||
|
Statistics Article View: 38 PDF Download: 7 |
||