Editor">
Editor Staff asked 3 months ago
Editor Staff asked 3 months ago 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 Answers
Editor">Editor Staff answered 3 months ago
Editor Staff answered 3 months ago 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.
