Treap (Cartesian Tree)
0 comments
- Points36
- Comments5
0 comments
Story details from Hacker News ↗ · linked article on cp-algorithms.com.
Treap (Cartesian Tree) was first seen on Hacker News · Front page on Oct 29, 2026. Since then it has appeared in 35 checks on 1 different day. Its best position was #20 of 30, reached on Oct 29, 13:07 UTC. It dropped off the list after Oct 29, 13:37 UTC.
Position on Hacker News · Front page at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Hacker News.
A few top-level comments from Hacker News, shortened. Read the full thread on Hacker News.
> Maintaining the sizes of subtrees Something that's not mentioned in that article is that you can maintain any monoid efficiently over balanced trees, not just the subtree size (aka you need an identity element and an associative operation). Most widely known monoids are boring, but there are more interesting…
The primary attraction of treaps (aside from fast intersection/union/diff) is that they are probably one of the easiest types of balanced trees that can be implemented manually if you need a dependency-free balanced tree. There are only two types of rotations, they are straightforward, and they are mirror images of…
A very nice problem solved using treap: https://stackoverflow.com/questions/79751600/solve-cses-moun...
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Oct 29, 13:37 UTC, after 1 day of trending.
#20 on Hacker News · Front page, on Oct 29, 13:07 UTC. Trendoday checks this list every 15 minutes.
It was first seen on Oct 29, 2026 and has been on the list on 1 day (35 checks) since.
36 points and 5 comments; submitted by vismit2000 on Oct 26, 2026.