digital search tree

(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

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "digital search tree", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: