(data structure)
Definition: A B-tree of order 3, that is, internal nodes have two or three children.
Generalization (I am a kind of ...)
B-tree with m=3.
See also 2-3-4 tree.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 23 January 2004.
HTML page formatted Mon Feb 2 13:10:40 2015.
Cite this as:
Paul E. Black, "2-3 tree", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 23 January 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/two3tree.html