A probabilistic data structure with O(log n) search, insert, and delete operations.
Each node has a random "tower height" based on probability p (default 0.5).
Higher levels act as "express lanes" for faster traversal.
Expected space: O(n), Expected height: O(log n)