B-tree
a self-balancing, tree-based data structure, that allows read/write access in logarithmic time
Facts
11 properties- Instance of
- data structure
- Subclass of
- (a,b)-tree, search tree, balanced tree, BV-tree, data structure[8]
- Average space complexity
- O(n)
- Average time complexity
- O(\log n)
- Different from
- binary tree[10]
- Discoverer or inventor
- Rudolf Bayer, Edward M. McCreight[6][7]
- Studied by
- algorithmics[12]
- Time of discovery or invention
- 1972[9]
- Worst-case space complexity
- O(n)
- Worst-case time complexity
- O(\log n) (insertion), O(\log n) (suppression), O(\log n) (recherche)
🏷️ Also known as
en B tree
en balanced multiway tree
en B-tree
ar بي - تري
cs B-tree
cs B strom
cs B-strom
de Bayerbaum
de B-Baum
de Bayer-Baum
de B-Tree
de Btree
de BBaum
es arbol-b
es B Árbol
es B tree
es arbol B
es B arbol
es árbol B más
es árbol B mas
🔖 Identifiers · 11
- OpenAlex ID
- C78669399
- Image (Wikimedia Commons)
- B-tree.svg ↗
- BabelNet ID
- 03234827n
- Dictionary of Algorithms and Data Structures ID
- btree, balancedMultiwayTree
- Freebase ID
- /m/01h9m
- MathWorld ID
- B-Tree
- Microsoft Academic ID (discontinued)
- 78669399
- OmegaWiki Defined Meaning
- 1704279
- PlanetMath ID
- Btree
- Stack Exchange tag
- stackoverflow.com
- Topic's main category
- Category:B-tree
🔗 Connections
Subtypes 4
Subclass of 3
Discoverer or inventor 2
Different from 1
Instance of 1
Maintained by WikiProject 1
Studied by 1
Topic's main category 1
Uses 1
← Category's main topic 1
← Different from 1
← Implementation of 1
Press Enter · cited answer in seconds