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


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 12 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "quad trie", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: