Treap
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. After any sequence of insertions and deletions of keys, the shape of the tree is a random variable with the same probability distribution as a random binary tree; in particular, with high probability its height is proportional to the logarithm of the number of keys, so that each search, insertion, or deletion operation takes logarithmic time to perform.
primaryTopic
Treap
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. After any sequence of insertions and deletions of keys, the shape of the tree is a random variable with the same probability distribution as a random binary tree; in particular, with high probability its height is proportional to the logarithm of the number of keys, so that each search, insertion, or deletion operation takes logarithmic time to perform.
has abstract
Drzewiec – forma binarnego drz ...... ą wyrazów „drzewo” i „kopiec”.
@pl
En Ciencias de la Computación, ...... rrado toma tiempo logarítmico.
@es
En informatique, les notions d ...... tue en un temps logarithmique.
@fr
In Informatica, il treap è un ...... do indipendente per ogni nodo.
@it
In computer science, the treap ...... s logarithmic time to perform.
@en
In der Informatik ist ein Trea ...... Baufen (aus Baum und Haufen).
@de
Treap (ツリープ)は、乱択アルゴリズムを使用した平衡2 ...... Heap (ヒープ)という2つの単語を組み合わせて作られた。
@ja
Дека́ртово де́рево — это двоич ...... пустимо, например, в ядрах ОС.
@ru
樹堆(英语:Treap),是有一个随机附加域满足堆的性质的二 ...... 樹,Treap的特点是實現簡單,且能基本實現隨機平衡的結構。
@zh
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
742,919,546
type
Randomized binary search tree
comment
Drzewiec – forma binarnego drz ...... ą wyrazów „drzewo” i „kopiec”.
@pl
En Ciencias de la Computación, ...... rrado toma tiempo logarítmico.
@es
En informatique, les notions d ...... tue en un temps logarithmique.
@fr
In Informatica, il treap è un ...... do indipendente per ogni nodo.
@it
In computer science, the treap ...... s logarithmic time to perform.
@en
In der Informatik ist ein Trea ...... Baufen (aus Baum und Haufen).
@de
Treap (ツリープ)は、乱択アルゴリズムを使用した平衡2 ...... Heap (ヒープ)という2つの単語を組み合わせて作られた。
@ja
Дека́ртово де́рево — это двоич ...... Недостатки декартового дерева:
@ru
樹堆(英语:Treap),是有一个随机附加域满足堆的性质的二 ...... 樹,Treap的特点是實現簡單,且能基本實現隨機平衡的結構。
@zh
label
Drzewiec (informatyka)
@pl
Treap
@de
Treap
@en
Treap
@es
Treap
@fr
Treap
@it
Treap
@ja
Декартово дерево
@ru
树堆
@zh