Zip Trees · HackerPapers discussions

Zip Trees — mentioned by mananaysiempre

Mon, 20 Apr 2026 04:03:45 GMT

Maestro Tarjan tells us skiplists and treaps are very nearly the same thing: https://arxiv.org/abs/1806.06726. I don’t see how to transpose TFA’s extension of the former to the latter, though.

Paper and discussion history. A mention is not an endorsement.

Zip Trees — mentioned by anfelor

Sat, 09 Mar 2024 18:11:30 GMT

Another interesting data structure related to skiplists but not mentioned here are zip trees: https://arxiv.org/abs/1806.06726 The are a tree-based version of skiplists and thus more suited to functional programming / immutable datastructures.

Paper and discussion history. A mention is not an endorsement.

Zip Trees — mentioned by anfelor

Tue, 30 May 2023 16:27:13 GMT

I would also recommend Koen Claessen's simplified finger trees (https://dl.acm.org/doi/abs/10.1145/3406088.3409026) and Zip trees (https://arxiv.org/pdf/1806.06726.pdf) for purely functional skip lists.

Paper and discussion history. A mention is not an endorsement.

Zip Trees — mentioned by anfelor

Sun, 07 Aug 2022 22:32:27 GMT

There is also a nice new datastructure called Zip Trees [1] which is isomorphic to skip lists in the sense that it performs exactly the same comparisons on insertion/deletion (but it can skip some redundant ones). I would expect zip trees to be faster than skip lists in practice. [1]: https://arxiv.org/abs/1806.06726

Paper and discussion history. A mention is not an endorsement.

Zip Trees — mentioned by Labo333

Wed, 04 Sep 2019 08:42:24 GMT

All of those operations are achievable when replacing sqrt with log by using Skip lists (https://en.wikipedia.org/wiki/Skip_list), and probably with Zip trees as well (https://arxiv.org/abs/1806.06726). That being said, the overload of a complex data structure might multiply the running time by a factor up to ~10 (mostly because of cache misses), so simpler structures will be more performant for short inputs. There is a more general pattern in most tree data structures where you can transform the log(n) recursive operations on the tree into sqrt(n) operations on a simpler structure with 2…

Paper and discussion history. A mention is not an endorsement.

Zip Trees — mentioned by bfirsh

Wed, 24 Oct 2018 15:34:59 GMT

If you’re on a phone, here’s an HTML version of the paper https://www.arxiv-vanity.com/papers/1806.06726/

Paper and discussion history. A mention is not an endorsement.

Zip Trees — HN submission

Wed, 24 Oct 2018 12:04:35 GMT

Zip Trees

301 points; 36 discussion replies on HN. Paper and source history. A submission is not an endorsement.