Updated Zipzip Apr 2026

Traditional are randomized binary search trees (BSTs) that "zip" nodes together based on assigned numeric ranks. While efficient, original zip trees suffered from a mathematical bias where smaller keys were often positioned closer to the root than larger keys, leading to uneven search times.

solve this by introducing a double-ranking system: Balancing the Bias: By using two independent ranks ( Updated Zipzip

Like their predecessors, they are history-independent , meaning the tree's final structure depends only on the keys it contains, not the order in which they were inserted or deleted. Current Developments (2025–2026) Traditional are randomized binary search trees (BSTs) that

New "just-in-time" models have been developed that use an expected constant number of bits ( they are history-independent