Explain 'Trie' search.

Explain 'Trie' search.

Approach: Describe walking down character nodes to find a word.

For each character, move to the child node. If a child doesn't exist, the word isn't there. After the last character, check if the node is marked as end-of-word.

Follow-up: How do you perform a prefix search?

Key concepts: character path, end-of-word.