words

A trie is a tree-like data structure that stores a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the trie stores the key associated with that node; instead, its position in the trie defines the key.