B-tree
0 sources
B-tree
Summary
B-tree is a data structure[1]. B-tree ranks in the top 5% of data_structure entities by monthly Wikipedia readership (1,035 views/month).[2]
Key Facts
- B-tree is credited with the discovery of Rudolf Bayer[3].
- B-tree is credited with the discovery of Edward M. McCreight[4].
- B-tree's image is recorded as B-tree.svg[5].
- B-tree's instance of is recorded as data structure[6].
- B-tree's subclass of is recorded as (a,b)-tree[7].
- B-tree's subclass of is recorded as search tree[8].
- B-tree's subclass of is recorded as balanced tree[9].
- B-tree's subclass of is recorded as BV-tree[10].
- B-tree's subclass of is recorded as data structure[11].
- B-tree's Commons category is recorded as B-Trees[12].
- B-tree's time of discovery or invention is recorded as +1972-00-00T00:00:00Z[13].
- B-tree's Freebase ID is recorded as /m/01h9m[14].
- B-tree's topic's main category is recorded as Category:B-tree[15].
- B-tree's OmegaWiki Defined Meaning is recorded as 1704279[16].
- B-tree's Stack Exchange tag is recorded as https://stackoverflow.com/tags/b-tree[17].
- B-tree's different from is recorded as binary tree[18].
- B-tree's uses is recorded as tree[19].
- B-tree's studied by is recorded as algorithmics[20].
- B-tree's BabelNet ID is recorded as 03234827n[21].
- B-tree's MathWorld ID is recorded as B-Tree[22].
- B-tree's worst-case time complexity is recorded as O(\log n) (insertion)[23].
- B-tree's worst-case time complexity is recorded as O(\log n) (suppression)[24].
- B-tree's worst-case time complexity is recorded as O(\log n) (recherche)[25].
- B-tree's average time complexity is recorded as O(\log n)[26].
- B-tree's average time complexity is recorded as O(\log n)[27].
Why It Matters
B-tree ranks in the top 5% of data_structure entities by monthly Wikipedia readership (1,035 views/month).[2] B-tree has Wikipedia articles in 21 language editions, a strong signal of global cultural recognition.[28] B-tree is known by 44 alternative names across languages and contexts.[29]