2–3 tree
B-tree of order 3
Facts
7 properties- Instance of
- data structure
- Followed by
- 2–3–4 tree[2]
- Average space complexity
- O( n )[7]
- Studied by
- algorithmics[5]
- Time of discovery or invention
- 1970[4]
- Worst-case space complexity
- O(n)[6]
🏷️ Also known as
en 2-3 tree
en 2–3 tree
cs 2-3 strom
de 2-3-Baum
de (2,3)-Baum
es arbol 2-3
es arbol 2 3
es árbol 2 3
es árbol 2-3
fa درخت 2-3
fa درخت ۲-۳
fr arbre 2-3
he עץ 2-3
hu 2-3 fa
it albero 2-3
ja 2-3木
ja BB木
ko 2-3 트리
ms Pepohon 2-3
pl 2-3 drzewa
🔖 Identifiers · 4
🔗 Connections
Followed by 1
Followed by (predecessor) 1
Instance of 1
Studied by 1
Subclass of 1
Press Enter · cited answer in seconds
0 sources
Summary
2–3 tree is a data structure[1].