Unlike other self-balancing binary search trees that provide worst case O(log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O(log n) 查找时间的自平衡二分查找树不同,替罪羊树与普通的二分查找树相比,并没有对每个节点增加额外的开销。
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
终结符号处理过程中,深入地研究了字符串匹配算法和正则表达式匹配算法,并实现了二叉排序树字符串匹配算法。
应用推荐