A Trie is a tree data structure for storing and efficiently searching strings. Each node represents a character, and the path from root to any node forms a string (or prefix).
Key Characteristics
✓Insert, search, delete all have O(m) time complexity (m = string length)
✓Very efficient for prefix searches (used for autocomplete, dictionary implementation)