Trie Search
Walk the characters; the word exists if the walk succeeds and ends on a terminal node.
Decision · step 2 of 7Trie: Search for a stored word
Letter 'c'. Children here: c, d. Follow 'c'.
What you will see
Focus walks edge by edge; a missing edge or non-terminal end means not found.
Cost
| Best | O(1) |
|---|---|
| Average | O(L) |
| Worst | O(L) |
| Space | O(1) |
How you work with it here
play it through, step one change at a time, scrub to any step, run it on your own input, predict what happens next.
Screen readers: Text and pattern cells announce index and character; each step announces the aligned positions, the comparison result and the shift.
Reduced motion: The pattern row snaps to its new alignment with a crossfade instead of sliding.
Before this
Taught by the same lesson
Trie covers these too, in the same run.