+1 vote
in Data Structures & Algorithms I by (110k points)
Suffix array can be created by performing __________ traversal of a suffix tree.

(a) breadth-first

(b) level order

(c) depth-first

(d) either breadth-first or level order

I want to ask this question from Arrays Types topic in section Arrays Types of Data Structures & Algorithms I

This question was addressed to me in exam.

1 Answer

+1 vote
by (408k points)
selected by
 
Best answer
Right answer is (c) depth-first

Best explanation: A suffix tree is a trie, which contains all the suffixes of the given string as their keys and positions in the string as their values. So, we can construct a suffix array by performing the depth-first traversal of a 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.

Categories

...