Trie
Learn Trie (Trie, Advanced DSA) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.
The Prefix Tree Data Structure A Trie stores strings character by character down a tree - every node represents one character, and words sharing a prefix share the same path from the root. This is what gives O(word length) insert/search, independent of how many total words are stored. * marks the end of a complete word ("cat", "car")