Zip Trees

@inproceedings{Tarjan2019ZipT,
  title={Zip Trees},
  author={Robert E. Tarjan and Caleb C. Levy},
  booktitle={WADS},
  year={2019}
}
  • Robert E. Tarjan, Caleb C. Levy
  • Published in WADS 2019
  • Computer Science, Mathematics
  • We introduce the zip tree, 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 rank ties broken in favor of smaller keys. Zip trees are essentially treaps (Seidel and Aragon 1996), except that ranks are drawn from a geometric distribution instead of a uniform distribution, and… CONTINUE READING
    Zipping Segment Trees

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 13 REFERENCES
    Anticoagulant and Fibrinolytic Effects of Certain ProlineContaining Peptides , Izv
    • 1988
    Stacked Multilayer Self-Organizing Map for Background Modeling
    30
    Randomized search trees
    173
    Zip Trees: A New Approach to Concurrent Binary Search Trees
    1
    Rank-Balanced Trees
    17