+1 vote
in Data Structures & Algorithms I by (88.2k points)
Can the two edges that are coming out of a node have labels of string beginning with the same character?

(a) True

(b) False

This key question is from Suffix Tree topic in portion Trie of Data Structures & Algorithms I

I have been asked this question in semester exam.

1 Answer

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

Explanation: 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. No two edges that are coming out of a node have labels of string beginning with the same character.

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

...