News for hackers. Stuff that matters.
Re:Treaps: A Simple Balanced Binary Tree by ScottBurson on Sunday September 11, 2011 @04:36PM (#2984743)
Keeping the element counts gives you something called weight-balanced binary trees. Here's a paper on them by Stephen Adams:

  http://groups.csail.mit.edu/mac/users/adams/BB/
I used a variation on these for my FSet functional collections library for Common Lisp.

There are no comments on this comment yet.