[ROSALINE] Suffix Tree

Problem: http://rosalind.info/problems/lrep/

Introduction to suffix tree: https://cs.uwaterloo.ca/~binma/cs482/06_suffix-tree-array.pdf



Suffix trees can do many string operations you might think are very hard, in linear time.

Application: Any substring of S is a prefix of a suffix.



Now we can solve this Rosalind's problem.



PS. Implement suffix tree for better representations.