Trie: unknown tree

The presentation will introduce data structure which is not in JDK, but is easy built "on the knee" and may be indispensable for string manipulation tasks. Two real examples of using the structure will be considered: a comparison of texts with the help of LCS and the choice of 1 suitable pattern of 200 000 per microsecond.