Self-balancing binary search tree
In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions. These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.
Wikipage disambiguates
AA treeAVL treeAdmissible treeArray data structureAssociative arrayAssociative containersB-treeBalanced binary search treeBalanced binary treeBalanced treeBalanced treesBentley–Ottmann algorithmBinary search algorithmBinary search treeBinary self-balancing search treeBinary treeBloom filterC++11Comparison of programming languages (associative array)Container (abstract data type)Dancing treeDatabase indexDay–Stout–Warren algorithmDijkstra's algorithmDouble-ended priority queueDynamic arrayDynamic problem (algorithms)Euler tour techniqueFusion treeGarsia–Wachs algorithmGeometry of binary search treesGeorgy Adelson-VelskyHTreeHash tableHeight-balanced binary search treeHeight-balanced binary treeHeight-balanced treeIacono's working set structureInterval treeJoin-based tree algorithms
Link from a Wikipage to another Wikipage
primaryTopic
Self-balancing binary search tree
In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions. These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.
has abstract
Em ciência da computação, uma ...... ays associativos, e conjuntos.
@pt
En ciencias de la computación, ...... Árbol AVL
* Árbol rojo-negro
@es
In computer science, a self-ba ...... tree because of the initials.
@en
In informatica, un albero bina ...... vengano eseguite in O(log n).
@it
平衡二分探索木（へいこうにぶんたんさくぎ、英: self-b ...... 抽象データ型を実装する最も効率のよいデータ構造の1つである。
@ja
平衡树是计算机科学中的一类数据结构，为改进的二叉查找树。一般 ...... 度趋于平衡，更广义的是指在树上所有可能查找的均摊复杂度偏低。
@zh
컴퓨터 과학에서, 자가 균형 (높이 균형) 이진 탐색 ...... y), 우선순위 큐, 과 같은 다른 로 쓰일 수 있다.
@ko
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,002,026,252
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
type
comment
Em ciência da computação, uma ...... ays associativos, e conjuntos.
@pt
En ciencias de la computación, ...... de árboles, en momentos clave.
@es
In computer science, a self-ba ...... ays, priority queues and sets.
@en
In informatica, un albero bina ...... vengano eseguite in O(log n).
@it
平衡二分探索木（へいこうにぶんたんさくぎ、英: self-b ...... 抽象データ型を実装する最も効率のよいデータ構造の1つである。
@ja
平衡树是计算机科学中的一类数据结构，为改进的二叉查找树。一般 ...... 度趋于平衡，更广义的是指在树上所有可能查找的均摊复杂度偏低。
@zh
컴퓨터 과학에서, 자가 균형 (높이 균형) 이진 탐색 ...... y), 우선순위 큐, 과 같은 다른 로 쓰일 수 있다.
@ko
label
Albero binario di ricerca bilanciato
@it
Self-balancing binary search tree
@en
Árbol binario de búsqueda auto-balanceable
@es
Árvore binária de busca balanceada
@pt
平衡二分探索木
@ja
平衡树
@zh
자가 균형 이진 탐색 트리
@ko