B-tree (Q677051)
Jump to navigation
Jump to search
a self-balancing, tree-based data structure, that allows read/write access in logarithmic time
- B tree
- balanced multiway tree
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | B-tree |
a self-balancing, tree-based data structure, that allows read/write access in logarithmic time |
|
Statements
1 reference
B-tree.svg
831 × 231; 18 KB
831 × 231; 18 KB
Exemple d'un 3-5 B-arbre (French)
3-5 B-tree example (English)
0 references
B-Trees
0 references
Identifiers
1 reference
Sitelinks
Wikipedia(34 entries)
- arwiki شجرة بي
- azwiki B-ağac
- cawiki Arbre-B
- ckbwiki درەختی بی
- cswiki B-strom
- dewiki B-Baum
- enwiki B-tree
- eswiki Árbol-B
- fawiki درخت بی
- frwiki Arbre B
- hewiki עץ B
- hrwiki B-stablo
- huwiki B-fa
- itwiki B-albero
- jawiki B木
- knwiki ಬಿ-ಟ್ರೀ
- kowiki B 트리
- lawiki Arbor B
- lmowiki B-alber
- ltwiki B-medis
- lvwiki B koks
- mlwiki ബി-ട്രീ
- nowiki B-tre
- plwiki B-drzewo
- ptwiki Árvore B
- ruwiki B-дерево
- shwiki B-stablo
- srwiki Б-стабло
- svwiki B-träd
- thwiki ต้นไม้แบบบี
- ukwiki Б-дерево
- viwiki B-cây
- zh_yuewiki B-樹
- zhwiki B树
Wikibooks(1 entry)
- ptwikibooks Algoritmos e Estruturas de Dados/Árvores B