Tries

A Trie (pronounced "try"), or prefix tree, is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. It is highly effective for tasks like autocomplete, spell checking, and finding words in a grid.