News for hackers. Stuff that matters.
Re:Treaps: A Simple Balanced Binary Tree by jrockway on Sunday September 11, 2011 @12:40PM (#2984103)
That result surprises me. Red-black trees do their work at insertion time, and AVL trees split the work between insertion and selection. This should make red-black trees faster at selection and AVL trees faster at insertion, and both should do a set of insertions and selections in the same time.

(A red-black tree is a plain-old binary search tree for everything but modifications.)

Re:Treaps: A Simple Balanced Binary Tree by pavpanchekha on Sunday September 11, 2011 @12:54PM (#2984141)
AVL trees give shorter path lengths. So the resulting structure ends up being better, depending on your exact balance of insertion and selection.
Re:Treaps: A Simple Balanced Binary Tree by SamReidHughes on Monday September 12, 2011 @08:19PM (#2989427)
Whaaa? AVL trees don't split the work between insertion and selection. Selections are plain old read-only BST lookups.