+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which of the following special type of trie is used for fast searching of the full texts?

(a) Ctrie

(b) Hash tree

(c) Suffix tree

(d) T tree

Origin of the question is Trie topic in chapter Trie of Data Structures & Algorithms I

I got this question in a job interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct choice is (c) Suffix tree

The best explanation: Suffix tree, a special type of trie, contains all the suffixes of the given text at the key and their position in the text as their values. So, suffix trees are used for fast searching of the full texts.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...