A suffix tree is a trie-like data structure representing all suffixe of a string. Such trees have a central role in many algorithms on strings, such as finding the longest repeated substring, finding all squares in a string, approximate string matching, data compression, and DNA sequence assembly. It is quite commonly felt, however, that the linear-time suffix tree algorithms presented in the literature are rather difficult to grasp. I implemented the suffix trees using two linear-time algorithms and tested the application to string matching in the thesis.