二叉排序树

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.

研究了基于一种新二叉树结构的二叉排序树的生成算法，并在此算法的基础上进行时间复杂度分析。

First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.

终结符号处理过程中，深入地研究了字符串匹配算法和正则表达式匹配算法，并实现了二叉排序树字符串匹配算法。

Data storage uses a binary sort tree, based on this will become a larger data structure.

数据的存储用了一个二叉排序树，在此基础上还变成了一个更大的数据结构…

A Discussion on Binary Sort Tree and Its Abnormity in Node Deleting

关于二叉排序树及删除异常的讨论

Balance Adjusting Algorithm of Balanced Binary Sort Tree

平衡二叉排序树的平衡调整简单算法