A trie stores strings as paths of characters; each edge represents a character. Prefix queries are efficient because all words with the same prefix share the same path, so lookup is O(L) where L is the key length. The trade‑off is higher memory usage compared to hashing.