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....
Saved in:
Main Author: | |
---|---|
Format: | Book |
Published: |
College of Education for Women,
2019-02-01T00:00:00Z.
|
Subjects: | |
Online Access: | Connect to this object online. |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Connect to this object online.3rd Floor Main Library
Call Number: |
A1234.567 |
---|---|
Copy 1 | Available |