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.
[ Parent
| on HN ]
There are no comments on this comment yet.