Igor Ostrovsky personal blog
Skip Lists are Fascinating
Skip lists are a fascinating data structure: very simple, and yet have the same asymptotic efficiency as much more complicated AVL trees and red-black trees.
- Points
- 112
- HN comments
- 34
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2011
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Mar 14, 2011 | Skip Lists are Fascinating by mbowcock | 112 | 34 |
