digital tree

(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 ...)

Specialization (... is a kind of me.)
digital search tree, trie, Patricia tree, suffix tree.

See also directed acyclic word graph, compact DAWG.

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 30 April 2007.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Paul E. Black, "digital tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 30 April 2007. (accessed TODAY) Available from: