2-3 tree
English
Noun
2-3
tree
(
plural
2-3 trees
)
(
computing
theory
)
A
tree
data structure
whose every
node
with
children
(internal node) has either two children and one data element, or three children and two data elements; a
B-tree
of
order
3.
Related terms
2-3-4 tree
2-4 tree
This article is issued from
Wiktionary
. The text is licensed under
Creative Commons - Attribution - Sharealike
. Additional terms may apply for the media files.