Which of the following algorithm of data compression uses a suffix tree?
(a) Weiner’s algorithm
(b) Farach’s algorithm
(c) Lempel – Ziv – Welch’s algorithm
(d) Alexander Morse’s algorithm
The question is from Suffix tree topic in chapter Trie of Data Structures & Algorithms I
The question was asked during an interview.