Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01843915n
Noun Concept
Categories: Probabilistic data structures, Search trees, Binary trees, Heaps (data structures)
EN
treap  Randomised binary search tree  randomized binary search tree  Randomized search tree  RBST
EN
In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of ordered keys and allow binary searches among the keys. Wikipedia
Definitions
Relations
Sources
EN
In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of ordered keys and allow binary searches among the keys. Wikipedia
Binary search tree in which the nodes are heap-ordered by random priorities Wikidata
A type of randomized binary search tree where nodes are labelled with randomly chosen priority values and which is simultaneously a heap on those priorities. Wiktionary
IS A
data structure
binary search tree
binary heap
HAS KIND
Cartesian tree
STUDIED BY
graph theory
Wikipedia
EN
treap
Wikidata
EN
treap
Wiktionary
EN
treap
Wikipedia Redirections
EN
Randomised binary search tree, randomized binary search tree, Randomized search tree, RBST (algorithm)
Wikidata Alias
EN
randomized binary search tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License