A Trie (prefix tree) is a tree-like data structure used to store a dynamic set of strings. Each node represents a single character, and paths from root to leaves represent words.
Use cases: Autocomplete, spell checking, IP routing, dictionary implementations.
m = length of word, N = number of words