How does randomness give O(log n) worst case?
Randomness gives O(log n) in *expectation*, not worst case—that's an honest trade. With probability 1/2, a node is promoted one level; with probability 1/4, two levels; with probability 1/8, three levels. This produces roughly equal numbers of nodes per level (50% at level 1, 25% at level 2, etc.), so the total height is O(log n) with very high probability. Worst case is O(n), but practically impossible.
Answered in
Skip Lists: The Shortcut Nobody RotatesBalanced trees rebalance with rotations. Skip lists layer express lanes with random promotion—same O(log n) search, simpler locking.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.