Tries

Tries are a data structure that can be used to store strings. The idea is to store the characters of the string in a tree-like structure, where each node of the tree represents a single character. We can use this structure to store strings in a way that allows us to quickly search for strings with a common prefix.

Visit the following resources to learn more:

• Tries - DataStructure Notes
• The Trie: A Neglected Data Structure
• TopCoder - Using Tries
• Stanford Lecture (real world use case)
• MIT, Advanced Data Structures, Strings (can get pretty obscure about halfway through)
• 0. Tries - Coursera
• 1. R Way Tries
• 2. Ternary Search Tries
• 3. Character Based Operations