Pronounced "tree," a trie is an indexing system in the form of a hierarchical tree that is used for predictive text and look-ahead text. Each node contains the actual letters in the word being stored. For example, the word "dog" would appear as "d" in a top node, down the trie to the "do" node and then to the node containing "dog." See
tree.