正如我所说，二叉树排序是一种非常有效且快速的方法。
As I said, binary trees are a very efficient and fast way of sorting.
研究了基于一种新二叉树结构的二叉排序树的生成算法，并在此算法的基础上进行时间复杂度分析。
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.
应用推荐