NIST

quad trie

(data structure)

Definition: A tree in which each node is split according to some subset of the key, typically a character.

See also quadtree, digital tree, Patricia tree.

Note: After [GBY91, pages 146-149].

The name comes from reTRIEval and is pronounced, "tree". See the historical note at trie.

Author: PEB

Implementation

insert (C), search (C)
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:08 2018.

Cite this as:
Paul E. Black, "quad 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/quadtrie.html