摘要
利用二叉树的结构性质 ,给出一个基于二叉树的位排序算法 (BBS算法 )。并证明了该算法是生成二叉树的这组数据按排序码升序的排序 ,最后 ,讨论了该算法的复杂性。
This paper presents a kind of algorithm for bit seguance based on the binary tree by using structural properties of binary tree,and proves that the algorithm of BBS is a seguance by sorting ascending order of the data group which create the binary tree in bit code.In thd end,we discussed the complexity of the algorithm.
出处
《山东科技大学学报（自然科学版）》
CAS
2000年第3期32-33,共2页
Journal of Shandong University of Science and Technology(Natural Science)
