Which statement is correct of suffix tree with a string of length n?
(a) The tree has n leaves.
(b) The tree has n roots
(c) Height of Tree is n
(d) Depth of tree is n
The origin of the question is Suffix Tree in division Trie of Data Structures & Algorithms I
I had been asked this question in my homework.
The correct option is (a) The tree has n leaves.
To explain: In computer science, a suffix tree is also known as PAT tree or position tree. It is a compressed search tree or prefix tree in which keys contain the suffix of text values as the text position. For a string of length n, the suffix tree has leaves equal to n.