Question
A programmer needs memory-efficient prefix indexing, and the chosen structure has the property that an edge may represent a string rather than one character. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Radix Tree
Explanation:
Radix Tree fits because it supports memory-efficient prefix indexing and an edge may represent a string rather than one character.
Both clues point to this choice.
Leave a Reply