(data structure)
Definition: A B-tree of order 4, that is, internal nodes have two, three, or four children.
Generalization (I am a kind of ...)
B-tree with m=4.
See also 2-3 tree.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 23 January 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "2-3-4 tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 23 January 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/two34tree.html
