|
|
Author:
Thomas Wenger 
|
|
|
|
|
| Description: |
|
Skip Lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforcing balancing and as a result the algorithms for insertion and deletion in skip lists are much simpler and significantly faster than equivalent algorithms for balanced trees.
|
|
|
Browse in Categories:
|
|
|
|
| More information about this material: |
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
no
Source Code Available:
yes
Accessiblity Information Available:
no
Copyright:
yes
Creative Commons:
This work is licensed under a
Attribution-NonCommercial-ShareAlike 3.0 United States
|
|
 |
About this material: |
Peer Reviews (not reviewed)
Workflow status (Not triaged)
Comments (none)
Learning Exercises (none)
Personal Collections (none)
Accessibility Info (none)
|
|
|
| |
Add your own: |
|
|
| |
|
|
|
|
| |
| |
|
