Question 26
A specialized tree data structure used for fast string prefix searching and dictionary lookups is a:
Tries store character sequences along paths, enabling O(k) prefix matching and autocomplete where k is the string length. A trie follows characters along edges, so lookup and prefix search take O(k) time for a key of length k, independent of the total number of stored keys (ignoring alphabet/map implementation costs).