Binary search tree
In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree. A binary tree is a type of data structure for storing data such as numbers in an organized way. Binary search trees allow binary search for fast lookup, addition and removal of data items, and can be used to implement dynamic sets and lookup tables. The order of nodes in a BST means that each comparison skips about half of the remaining tree, so the whole lookup takes time proportional to the binary logarithm of the number of items stored in the tree. This is much better than the linear time required to find items by key in an (unsorted) arra
Wikipage disambiguates
Wikipage redirect
2–3 treeAA treeAVL treeAbstraction (computer science)American Computer Science LeagueAssociation listAssociative arrayB+ treeB-treeBSTBentley–Ottmann algorithmBest, worst and average caseBinary Search TreeBinary logarithmBinary search algorithmBinary search treesBinary treeBit-reversal permutationC++11CC systemCalkin–Wilf treeCartesian treeCecilia R. AragonCompare-and-swapContainer (abstract data type)Day–Stout–Warren algorithmDistributed tree searchDouble compare-and-swapEndiannessErik DemaineEuclidean algorithmExponential treeFinger searchFinger search treeFortune's algorithmFractal tree indexGarsia–Wachs algorithmGeometry of binary search treesHeap (data structure)Huffman coding
Link from a Wikipage to another Wikipage
primaryTopic
Binary search tree
In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a key greater than all the keys in the node's left subtree and less than those in its right subtree. A binary tree is a type of data structure for storing data such as numbers in an organized way. Binary search trees allow binary search for fast lookup, addition and removal of data items, and can be used to implement dynamic sets and lookup tables. The order of nodes in a BST means that each comparison skips about half of the remaining tree, so the whole lookup takes time proportional to the binary logarithm of the number of items stored in the tree. This is much better than the linear time required to find items by key in an (unsorted) arra
has abstract
Binarne drzewo poszukiwań (ang ...... łowniki, kolejki priorytetowe.
@pl
Binární vyhledávací strom (BST ...... počtu reprezentovaných prvků.
@cs
Dalam ilmu komputer, sebuah po ...... ilai dari simpul.
* l
*
* s
@in
Een binaire zoekboom is een bi ...... aarde in de boom te vinden is.
@nl
Em Ciência da computação, uma ...... orma a permitir busca binária.
@pt
En ciències de la computació, ...... ura de dades en forma d'arbre.
@ca
En informatique, un arbre bina ...... insérer ou supprimer une clé.
@fr
Ett binärt sökträd är ett binä ...... log n) och i värsta fall Θ(n).
@sv
In computer science, a binary ...... search tree have been studied.
@en
In der Informatik ist ein binä ...... ntlich höheren Speicherbedarf.
@de
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,026,070,224
Link from a Wikipage to another Wikipage
invented by
P.F. Windley, A.D. Booth, A.J.T. Colin, and T.N. Hibbard
@en
invented year
name
Binary search tree
@en
type
tree
@en
wikiPageUsesTemplate
subject
hypernym
comment
Binarne drzewo poszukiwań (ang ...... czy posortowanych niemalejąco.
@pl
Binární vyhledávací strom (BST ...... větší než je klíč tohoto uzlu.
@cs
Dalam ilmu komputer, sebuah po ...... ilai dari simpul.
* l
*
* s
@in
Een binaire zoekboom is een bi ...... ijk dan de waarde in de knoop.
@nl
Em Ciência da computação, uma ...... orma a permitir busca binária.
@pt
En ciències de la computació, ...... ura de dades en forma d'arbre.
@ca
En informatique, un arbre bina ...... insérer ou supprimer une clé.
@fr
Ett binärt sökträd är ett binä ...... log n) och i värsta fall Θ(n).
@sv
In computer science, a binary ...... s by key in an (unsorted) arra
@en
In der Informatik ist ein binä ...... üssel des Knotens selbst sind.
@de
label
Albero binario di ricerca
@it
Arbre binaire de recherche
@fr
Arbre binari de cerca
@ca
Binaire zoekboom
@nl
Binarne drzewo poszukiwań
@pl
Binary search tree
@en
Binární vyhledávací strom
@cs
Binärer Suchbaum
@de
Binärt sökträd
@sv
Pohon biner terurut
@in