(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 17 December 2004.
HTML page formatted Mon Sep 11 09:46:01 2006.
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. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/compactTrie.html
