Probabilistic Balancing
← Back to Skip Lists
Each node is randomly promoted to higher levels with probability p (typically 1/2). This creates express lanes that provide O(log n) expected search time without deterministic rotations. Simpler to implement than balanced BSTs.