+1 vote
in Data Structures & Algorithms I by (88.2k points)
Which tree allows fast implementation of a set of string operation?

(a) Rope Tree

(b) Tango Tree

(c) Generalized Suffix Tree

(d) Top Tree

The above asked question is from Suffix Tree in chapter Trie of Data Structures & Algorithms I

I got this question in an interview for internship.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (c) Generalized Suffix Tree

The best explanation: In computer science, the generalized suffix is a special suffix tree which contains a set of strings or set of words instead of a single string like suffix tree.  Hence Different operation can be performed on a set of strings using a generalized suffix tree.

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.