Crowdly
Add to Chrome
Tries and suffix trees Assume that we have a prefix trie that stores N words ove...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
Tries and suffix trees
Assume that we have a prefix trie that stores N words over a fixed alphabet, and that moving to a child node in the trie costs constant time. What is the WORST-CASE time to decide whether a pattern of length M is one of the stored words?
❌
❌
✅
❌
❌