Why is the brute-force approach less ideal here?
Practice this question from Implement Trie - Prefix Tree Pattern Practice Quiz, with options and an explanation.
Question
Why is the brute-force approach less ideal here?
Option A — Correct answer
List scanning makes prefix checks depend on stored word count.
Option B
It always uses no memory
Option C
It avoids all state changes
Option D
It only works for binary search
Explanation
List scanning makes prefix checks depend on stored word count.