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.
(A red-black tree is a plain-old binary search tree for everything but modifications.)