Updated Zipzip -

) per node, making them highly suitable for memory-constrained environments.

), zip-zip trees ensure the expected depth of the smallest key is identical to the largest, resulting in a more uniform and balanced tree. Updated Zipzip

New "just-in-time" models have been developed that use an expected constant number of bits ( ) per node, making them highly suitable for

Recent research published in early 2026 has expanded the utility of these structures: ) per node