+1 vote
in Data Structures & Algorithms I by (88.2k points)
Do all the nodes have at least two children in suffix tree.

(a) True

(b) False

I want to ask this question from Suffix Tree topic in section Trie of Data Structures & Algorithms I

I have been asked this question during an interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
The correct choice is (b) False

To explain: It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. All the nodes (internal) except for the root nodes have at least two children.

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.