binary tree sort

基本解釋

Data storage uses a binary sort tree, based on this will become a larger data structure.
數(shù)據(jù)的存儲用了一個二叉排序樹，在此基礎(chǔ)上還變成了一個更大的數(shù)據(jù)結(jié)構(gòu)…
nulung.com
First, classic string matching algorithms and regular expression matching algorithms are studied; second a binary sort tree string matching algorithm is proposed and realized.
終結(jié)符號處理過程中，深入地研究了字符串匹配算法和正則表達(dá)式匹配算法，并實(shí)現(xiàn)了二叉排序樹字符串匹配算法。
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.
研究了基于一種新二叉樹結(jié)構(gòu)的二叉排序樹的生成算法，并在此算法的基礎(chǔ)上進(jìn)行時(shí)間復(fù)雜度分析。