(data structure)
Definition: A binary search tree in which nodes have another key, called the priority. Operations also keep the nodes heap ordered with regard to the priority.
Generalization (I am a kind of ...)
binary search tree.
Specialization (... is a kind of me.)
randomized binary search tree.
Note: The name comes from "tree" and "heap".
Some call "randomized binary search trees" treaps, but strictly a treap does not define how priorities are assigned.
Author: PEB
Raimund G. Seidel and Cecilia R. Aragon, Randomized Search Trees, Algorithmica, 16:464-497 (1996). Also in 30th Annual Symposium on Foundations of Computer Science, pages 540-545, Research Triangle Park, North Carolina, 30 October-1 November 1989. IEEE.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 7 September 2010.
HTML page formatted Tue Dec 6 16:16:33 2011.
Cite this as:
Paul E. Black, "treap", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 7 September 2010. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/treap.html
