2–3 tree
0 sources
2–3 tree
Summary
2–3 tree is a data structure[1]. It draws 82 Wikipedia views per month (data_structure category, ranking #20 of 40).[2]
Key Facts
- 2–3 tree's instance of is recorded as data structure[3].
- 2–3 tree's followed by is recorded as 2–3–4 tree[4].
- 2–3 tree's subclass of is recorded as B-tree[5].
- 2–3 tree's Commons category is recorded as 2–3 tree[6].
- 2–3 tree's time of discovery or invention is recorded as +1970-00-00T00:00:00Z[7].
- 2–3 tree's Freebase ID is recorded as /m/02_8j_[8].
- 2–3 tree's studied by is recorded as algorithmics[9].
- 2–3 tree's worst-case space complexity is recorded as O(n)[10].
- 2–3 tree's average space complexity is recorded as O( n )[11].
- 2–3 tree's Dictionary of Algorithms and Data Structures ID is recorded as two3tree[12].
- 2–3 tree's Microsoft Academic ID is recorded as 13818915[13].
- 2–3 tree's PlanetMath ID is recorded as 23Tree[14].
Body
Adaptations and Inspiration
2–3 tree's followed by is recorded as 2–3–4 tree[4].
Why It Matters
2–3 tree draws 82 Wikipedia views per month (data_structure category, ranking #20 of 40).[2] It has Wikipedia articles in 15 language editions, a strong signal of global cultural recognition.[15] It is known by 8 alternative names across languages and contexts.[16]