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

(a) Rope Tree

(b) Suffix Tree

(c) Tango Tree

(d) Top Tree

Question is taken from Suffix Tree in section Trie of Data Structures & Algorithms I

The question was asked in quiz.

1 Answer

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

Best explanation: In computer science, a suffix tree is also known as PAT tree or position tree. It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. It allows fast string operation to be carried out by the user.

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

...