About: Random binary tree

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Random binary tree Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatProbabilisticDataStructures, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRandom_binary_tree

In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees. Two different distributions are commonly used: binary trees formed by inserting nodes one at a time according to a random permutation, and binary trees chosen from a uniform discrete distribution in which all distinct trees are equally likely. It is also possible to form other distributions, for instance by repeated splitting. Adding and removing nodes directly in a random binary tree will in general disrupt its random structure, but the treap and related randomized binary search tree data structures use the principle of binary trees formed from a random permutation in order to maintain a balanced binary search tree dynamically as nodes ar

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Arrangement105726596 yago:Cognition100023271 yago:DataStructure105728493 yago:PsychologicalFeature100023100 yago:Structure105726345 yago:WikicatProbabilisticDataStructures
rdfs:label	Algorithme de Rémy (fr) Losowe drzewo binarne (pl) Random binary tree (en) Árvore binária aleatória (pt)
rdfs:comment	L'algorithme de Rémy est un générateur d'arbres binaires, dont la principale application est un algorithme efficace de génération aléatoire d'arbres binaires. L'algorithme doit son nom à son inventeur Jean-Luc Rémy. (fr) Losowe drzewo binarne – losowe drzewo binarne oznacza drzewo binarne losowo wybrane z pewnego rozkładu prawdopodobieństwa na drzewach binarnych. Powszechnie używane są dwie metody konstruowania losowych drzew binarnych: tworzone przez węzły wstawiane pojedynczo zgodnie z losową permutacją oraz drzewa binarne wybrane z równomiernym rozkładem dyskretnym, w którym wszystkie odrębne drzewa są jednakowo prawdopodobne. Dostępne są również inne metody tworzenia losowych drzew binarnych, na przykład przez wielokrotny podział. (pl) In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees. Two different distributions are commonly used: binary trees formed by inserting nodes one at a time according to a random permutation, and binary trees chosen from a uniform discrete distribution in which all distinct trees are equally likely. It is also possible to form other distributions, for instance by repeated splitting. Adding and removing nodes directly in a random binary tree will in general disrupt its random structure, but the treap and related randomized binary search tree data structures use the principle of binary trees formed from a random permutation in order to maintain a balanced binary search tree dynamically as nodes ar (en) Em ciência da computação e teoria da probabilidade, uma árvore binária aleatória refere-se a uma árvore binária selecionada aleatoriamente a partir de uma distribuição de probabilidade em árvores binárias. Duas distribuições diferentes são comumente utilizadas: árvores binárias formadas por inserção de nós um de cada vez, de acordo com uma permutação aleatória, e árvores binárias escolhidas a partir de uma distribuição uniforme discreta, nas quais, todas as árvores distintas são igualmente prováveis. Também é possível formar outras distribuições, por exemplo, repetindo-se o particionamento. Adicionar e remover nós diretamente em uma árvore binária aleatória, em geral, irá interromper sua estrutura aleatória, mas outras estruturas de dados árvore de busca binária usam o princípio de árvores (pt)
dcterms:subject	Statistical randomness Probabilistic data structures Binary trees
Wikipage page ID	22045750 (xsd:integer)
Wikipage revision ID	1088197311 (xsd:integer)
Link from a Wikipage to another Wikipage	Probability distribution Pat Morin Binary heap Binary search tree Binary tree Statistical randomness Probabilistic data structures Beta distribution Paul Kruszewski Register allocation Multiplicative inverse Compiler Strahler number Computer science Total order Treap Data structure Evolutionary tree Expected value Probability theory Harmonic number Binary trees Big O notation Parse tree Natural logarithm Cartesian tree Catalan number Tree rotation Uniform distribution (discrete) Expression (mathematics) Random permutation Random tree Balanced binary search tree Binary search
Link from a Wikipage to an external page	http://citeseer.ist.psu.edu/seidel96randomized.html http://opendatastructures.org/versions/edition-0.1e/ods-java/7_Random_Binary_Search_Tree.html http://citeseer.ist.psu.edu/article/martinez97randomized.html http://www-cs-faculty.stanford.edu/~knuth/fasc4a.ps.gz
sameAs	Random binary tree Random binary tree Random binary tree Random binary tree Random binary tree Random binary tree Random binary tree
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Harvtxt dbt:Math dbt:Mvar dbt:OEIS dbt:Reflist dbt:Short_description dbt:Probabilistic
has abstract	In computer science and probability theory, a random binary tree is a binary tree selected at random from some probability distribution on binary trees. Two different distributions are commonly used: binary trees formed by inserting nodes one at a time according to a random permutation, and binary trees chosen from a uniform discrete distribution in which all distinct trees are equally likely. It is also possible to form other distributions, for instance by repeated splitting. Adding and removing nodes directly in a random binary tree will in general disrupt its random structure, but the treap and related randomized binary search tree data structures use the principle of binary trees formed from a random permutation in order to maintain a balanced binary search tree dynamically as nodes are inserted and deleted. For random trees that are not necessarily binary, see random tree. (en) L'algorithme de Rémy est un générateur d'arbres binaires, dont la principale application est un algorithme efficace de génération aléatoire d'arbres binaires. L'algorithme doit son nom à son inventeur Jean-Luc Rémy. (fr) Losowe drzewo binarne – losowe drzewo binarne oznacza drzewo binarne losowo wybrane z pewnego rozkładu prawdopodobieństwa na drzewach binarnych. Powszechnie używane są dwie metody konstruowania losowych drzew binarnych: tworzone przez węzły wstawiane pojedynczo zgodnie z losową permutacją oraz drzewa binarne wybrane z równomiernym rozkładem dyskretnym, w którym wszystkie odrębne drzewa są jednakowo prawdopodobne. Dostępne są również inne metody tworzenia losowych drzew binarnych, na przykład przez wielokrotny podział. (pl) Em ciência da computação e teoria da probabilidade, uma árvore binária aleatória refere-se a uma árvore binária selecionada aleatoriamente a partir de uma distribuição de probabilidade em árvores binárias. Duas distribuições diferentes são comumente utilizadas: árvores binárias formadas por inserção de nós um de cada vez, de acordo com uma permutação aleatória, e árvores binárias escolhidas a partir de uma distribuição uniforme discreta, nas quais, todas as árvores distintas são igualmente prováveis. Também é possível formar outras distribuições, por exemplo, repetindo-se o particionamento. Adicionar e remover nós diretamente em uma árvore binária aleatória, em geral, irá interromper sua estrutura aleatória, mas outras estruturas de dados árvore de busca binária usam o princípio de árvores binárias formadas a partir de uma permutação aleatória, a fim de manter uma árvore de busca binária balanceada de forma dinâmica, ao inserir e remover nós. Para árvores aleatórias que não são necessariamente binárias, consulte . (pt)
prov:wasDerivedFrom	wikipedia-en:Random_binary_tree?oldid=1088197311&ns=0
page length (characters) of wiki page	15466 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Random_binary_tree
is Link from a Wikipage to another Wikipage of	Binary tree Paul Kruszewski Strahler number Thomas N. Hibbard Random graph Random tree Random binary search tree
is Wikipage redirect of	Random binary search tree
is foaf:primaryTopic of	wikipedia-en:Random_binary_tree

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software