Part V · Trees, Priority Structures and Range Queries
28. Tries, Prefix Trees and Dictionary Structures
7 lessons•34 topics•Intermediate / Advanced
7 of 7 lessons published
28.016 animated
Trie fundamentals
- Root and edges
- Character mapping
- Insert
- Search
- StartsWith
- Word termination
- Delete
28.021 animated
Trie implementation
- Array child pointers
- HashMap child map
- Node memory
- Compressed alphabets
- Iterative vs recursive walk
28.035 animated
Prefix problems
- Autocomplete
- Common prefixes
- Prefix counts
- Contact directory
- Word dictionary
28.044 animated
Wildcard searches
- Dot wildcard
- Prefix/suffix filters
- DFS on trie
- Word search II
28.052 animated
Bitwise tries
- XOR maximum pair
- XOR subarrays
- Binary integers
- Bit length
- Online XOR queries
28.063 animated
Compressed tries
- Radix tree
- Patricia trie
- Ternary search tree
- Memory reduction
28.074 animated
Aho-Corasick preview
- Failure links
- Dictionary matching
- Multiple-pattern searching
- Automaton states