Skip lists are an efficient alternative to balanced trees, and rather easier to implement correctly.The skip list, described by William Pugh in "Skip Lists: A Probabilistic Alternative to Balanced Trees"
-
Notifications
You must be signed in to change notification settings - Fork 0
Skip lists are an efficient alternative to balanced trees, and rather easier to implement correctly.The skip list, described by William Pugh in "Skip Lists: A Probabilistic Alternative to Balanced Trees"
License
apppur/skiplist
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Skip lists are an efficient alternative to balanced trees, and rather easier to implement correctly.The skip list, described by William Pugh in "Skip Lists: A Probabilistic Alternative to Balanced Trees"
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published