(data structure)
Definition: A tree for storing strings in which nodes are organized by substrings common to two or more strings.
See also trie, digital search tree, directed acyclic word graph, compact DAWG, Patricia tree, suffix tree.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:03:38 2004.
HTML page formatted Wed Oct 26 09:47:26 2005.
Cite this as:
Paul E. Black, "digital tree", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/digitaltree.html
