Associated article: Treaps in Java
Unpublished source code accompanying the article by Stefan Nilsson in which he discusses "treaps"--the randomized search trees discovered by C.R. Aragon and R. Seidel, provides the functionality of a general-purpose sorting routine, priority queue, hash-table, stack, or standard queue. Stefan shows you how to implement treaps in Java. Requires UNZIP to extract.
Table Of Contents: treap/classes/order/Ordered.class treap/classes/order/Treap.class treap/classes/order/TreapEnumeration.class treap/classes/order/Tree.class treap/doc/AllNames.html treap/doc/packages.html treap/doc/images/blue-ball-small.gif treap/doc/images/blue-ball....