(data structure)
Definition: A tree for storing strings in which nodes are organized by substrings common to two or more strings.
Generalization (I am a kind of ...)
tree.
Specialization (... is a kind of me.)
digital search tree, trie, Patricia tree, suffix tree.
See also directed acyclic word graph, compact DAWG.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 30 April 2007.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "digital tree", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 30 April 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/digitaltree.html
