1
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.
Writing about software, systems, AI, and other things I find interesting.
Visit igoro.com → RSS feedOn Hacker News Mar 2011 – Jul 2023
Software Engineering 2Systems & Performance 1Math & Algorithms 1
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.