Editor">
Editor Staff asked 5 months ago
Editor Staff asked 5 months ago
Which of the following special type of trie is used for fast searching of the full texts?
(a) Ctrie
(b) Hash tree
(c) Suffix tree
(d) T tree
Origin of the question is Trie topic in chapter Trie of Data Structures & Algorithms I
I got this question in a job interview.
1 Answers
Editor">Editor Staff answered 5 months ago
Editor Staff answered 5 months ago
Correct choice is (c) Suffix tree
The best explanation: Suffix tree, a special type of trie, contains all the suffixes of the given text at the key and their position in the text as their values. So, suffix trees are used for fast searching of the full texts.
