(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."
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 Fri Dec 17 12:27:53 2004.
HTML page formatted Wed Oct 26 09:47:21 2005.
Cite this as:
Paul E. Black, "compact trie", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/compactTrie.html
