Question

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.

Answer 1

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.