Date: 05/28/06 (Algorithms)    Keywords: no keywords

I was just wondering how frequently treaps are used in practice. According to wikipedia, they were discovered recently in 1996. The definition is: " A treap is a binary search tree in which each node has both a key and a priority: nodes are ordered in an inorder fashion by their keys (as in a standard binary search tree) and are heap-ordered by their priorities (so that the each parent has a higher priority than its children)."

Source: http://community.livejournal.com/algorithms/76398.html