(data structure)
Definition: A tree with any number of children for each node.
See also binary tree, k-ary tree, B-tree, binary tree representation of trees.
Note: A typical implementation is to have a list of child nodes at each node, rather than a fixed number of children. A more elaborate implementation is to have a fixed number of children, to handle most nodes efficiently, and a linked list for those rare nodes that have more children. See also the binary tree representation of trees.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 27 October 2005.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "multiway tree", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 27 October 2005. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/multiwaytree.html