Zip Trees

18 Jun 2018Robert E. TarjanCaleb C. LevyStephen Timmel

We introduce the zip tree, a form of randomized binary search tree. One can view a zip tree as a treap (Seidel and Aragon 1996) in which priority ties are allowed and in which insertions and deletions are done by unmerging and merging paths ("unzipping" and "zipping") rather than by doing rotations... (read more)

PDF Abstract

Code


No code implementations yet. Submit your code now

Tasks


Results from the Paper


  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper


METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet