First, classic string matching algorithms and regular expression matching algorithms are studied; second a binarysorttree string matching algorithm is proposed and realized.
This paper is devoted to a study of an algorithm of generating the binary-sort-tree on the new structure and, on the basis of this algorithm, an analysis is made of the time complexity.