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....
Сохранить в:
| Главный автор: | |
|---|---|
| Формат: | |
| Опубликовано: |
College of Education for Women,
2019-02-01T00:00:00Z.
|
| Предметы: | |
| Online-ссылка: | Connect to this object online. |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
Internet
Connect to this object online.3rd Floor Main Library
| Шифр: |
A1234.567 |
|---|---|
| Копировать 1 | Доступно |