A Trie is a tree where each node stores one character. Paths from root to leaves spell out words. Perfect for autocomplete, spell-checking, and prefix queries.
Each node holds one character and a map of children. The root is empty. A node marked isEnd=true means a complete word ends there. Nodes with a dot (●) are word-end markers.