Searching a list of words for every word starting with a prefix means checking each word in full. A Trie shares common prefixes in a tree, so a prefix lookup costs only the length of the prefix. Use it for autocomplete, spell checking and word search games. If you only need exact word lookups, a HashSet is simpler and uses less memory.