To refer to this page use:
|Abstract:||We introduce the zip tree, (Zip: “To move very fast.”) a form of randomized binary search tree that integrates previous ideas into one practical, performant, and pleasant-to-implement package. A zip tree is a binary search tree in which each node has a numeric rank and the tree is (max)-heap-ordered with respect to ranks, with ties broken in favor of smaller keys. Zip trees are essentially treaps , except that ranks are drawn from a geometric distribution instead of a uniform distribution, and we allow rank ties. These changes enable us to use fewer random bits per node. We perform insertions and deletions by unmerging and merging paths (unzipping and zipping) rather than by doing rotations, which avoids some pointer changes and improves efficiency. The methods of zipping and unzipping take inspiration from previous top-down approaches to insertion and deletion by Stephenson , Martínez and Roura , and Sprugnoli . From a theoretical standpoint, this work provides two main results. First, zip trees require only 𝑂(loglog𝑛) bits (with high probability) to represent the largest rank in an n-node binary search tree; previous data structures require 𝑂(log𝑛) bits for the largest rank. Second, zip trees are naturally isomorphic to skip lists , and simplify Dean and Jones’ mapping between skip lists and binary search trees .|
|Citation:||Tarjan, Robert E., Caleb C. Levy, and Stephen Timmel. "Zip Trees." In Workshop on Algorithms and Data Structures (2019): pp. 566-577. doi:10.1007/978-3-030-24766-9_41|
|Pages:||566 - 577|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Workshop on Algorithms and Data Structures|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.