NIST

compact trie

(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


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 1 August 2008.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Paul E. Black, "compact trie", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 1 August 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/compactTrie.html