Tries

A trie (prefix tree) stores strings character-by-character in a tree structure, enabling O(m) insert, search, and prefix lookup where m is the word length. Master basic trie operations, wildcard DFS, and trie-accelerated grid search.