• A type of k-ary search tree, a tree data structure used for locating specific keys from within a set. These keys are most often strings, with links between nodes defined not by the entire key, but by individual characters. In order to access a key (to recover its value, change it, or remove it), the trie is traversed depth-first, following the links between nodes, which represent each character in the key. The idea of a trie for representing a set of strings was first abstractly described in 1912 by Axel Thue. ← Wikipedia

1. Related terms: Node · KEY · Breadth-first search · Access key
2. Previous term: Trident
3. Next term: Triple constraint
4. Random term: Programming language theory (webglossary.info/random 🎲)