"Section 20: Tries"
Section 20: Tries
Tries (prefix trees) are tree-like data structures used for efficient retrieval of strings and prefix-based searches.
Lessons
| # | Lesson Name | Duration | Notes |
|---|---|---|---|
| 1 | Introduction to Tries | 16m 35s | |
| 2 | Trie and TrieNode Structure | 20m 7s | |
| 3 | Insert Search PrefixFind - Trie Code | 17m 33s | |
| 4 | Time & Space Complexity of Tries | — | |
| 5 | Word Search with Tries | — | |
| 6 | Design Add and Search Words | — | |
| 7 | Implement Trie | — | |
| 8 | Longest Word in Dictionary | — |
Lesson Checklist
- [ ] Introduction to Tries (16m 35s)
- [ ] Trie and TrieNode Structure (20m 7s)
- [ ] Insert Search PrefixFind - Trie Code (17m 33s)
- [ ] Time & Space Complexity of Tries
- [ ] Word Search with Tries
- [ ] Design Add and Search Words
- [ ] Implement Trie
- [ ] Longest Word in Dictionary
My Notes
Add your key takeaways here...