Get App

Python: Which practice avoids a common mistake with Trie / Prefix Tree?

Difficulty:

Medium

Questions:

1

Time Limit:

2 minutes

Passing Score:

100%

Question

Which practice avoids a common mistake with Trie / Prefix Tree?

  1. Ignore the Trie / Prefix Tree issue and rely on team discipline instead of clearer APIs or invariants.
  2. Silence the Trie / Prefix Tree problem by using broad catches, hidden globals, or extra shared mutable state.
  3. Do not ignore the memory cost of storing many nodes when the input set is small or exact-key lookup would be enough.
  4. Prefer the version of Trie / Prefix Tree that makes behavior less predictable as long as the code still runs.

Hint

Look for the option that protects correctness instead of hiding the problem.

Answer and rationale

Correct answer: C. Do not ignore the memory cost of storing many nodes when the input set is small or exact-key lookup would be enough.

Do not ignore the memory cost of storing many nodes when the input set is small or exact-key lookup would be enough. This is a common failure mode in real Python code and a frequent interview follow-up.

Track: Python