(data structure)
Definition: A trie in which nonbranching subtrees leading to leaf nodes are cut off.
Generalization (I am a kind of ...)
trie.
See also Patricia tree.
Note: The name comes from reTRIEval and is pronounced, "tree." See the historical note at trie.
Author: PEB
Explanations of and comparisons between tries and suffix trees.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 1 August 2008.
HTML page formatted Fri Aug 1 10:20:43 2008.
Cite this as:
Paul E. Black, "compact trie", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 1 August 2008. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/compactTrie.html
