Some applications of trie data structure include:
- dictionary lookup
- prefix searches
- auto complete feature in text editors
- command completion in IDE etc
- phone number/contacts searching
- IP lookups
- mapping URLs to operations on a web server
- matching sentences (if a trie based on a sequence of words, like Gmail autocompletion)
- index a complete text (as the Ukkonen suffix tree algorithm alternative)