Question
Which data structure or concept is best described as a compressed trie containing all suffixes of a string?
Select an option. Your answer will be checked instantly.
Correct Answer: A. Suffix Tree
Explanation:
Suffix Tree is a compressed trie containing all suffixes of a string.
This description distinguishes it from the other choices.
Leave a Reply