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 24 August 2017.
HTML page formatted Fri Feb 23 10:06:07 2018.

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