Recent research published in early 2026 has expanded the utility of these structures:
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) Updated Zipzip
) per node, making them highly suitable for memory-constrained environments. Recent research published in early 2026 has expanded
solve this by introducing a double-ranking system: Balancing the Bias: By using two independent ranks ( While efficient, original zip trees suffered from a
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.
), zip-zip trees ensure the expected depth of the smallest key is identical to the largest, resulting in a more uniform and balanced tree.