Implement Trie (Prefix Tree)
Implement a trie with insert, search and startsWith operations.
Progress cannot be saved in this browser, so completed lessons will reset when you leave.
Lesson notes
Try it before you watch
Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.
Reveal the key idea
Each node stores a dictionary of children and a flag that marks the end of a word; every operation walks one node per character.
Pattern: Trees & tries. Most tree problems are a recursive question asked of the left subtree, the right subtree, and the root.
Complexity
| Measure | Bound |
|---|---|
| Time | O(L) per operation |
| Extra space | O(total characters inserted) |
Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.