(data structure)
Definition: A trie which stores the strings in internal nodes, so there is no need for extra leaf nodes to store the strings.
See also digital 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 Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
Paul E. Black, "digital search tree", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/digitalSearchTree.html