摘要
给出了一种最佳二叉排序树的动态检索算法 ,其性能优于二叉排序树和平衡二叉树 ,克服了用折半检索方法构造最佳二叉排序树的缺点 ,且不会因插入结点而发生蜕变 ,影响检索的性能 .
This paper gives a dynamic retieval algorithm of the optimal binary sort tree. Its peformance is better than the binary sort tree and the balanced binary tree. It overcomes the defect of constructing the optimal binary sort tree using the binary search search algorithm.It will not affect the retrieval performance of the optimal binary sort tree, because the tree will not regress when we insert nodes into it using this algorithm.
出处
《武汉大学学报（自然科学版）》
CSCD
2000年第3期293-296,共4页
Journal of Wuhan University(Natural Science Edition)
关键词
树形目录
最佳二叉排序树
动态检索算法
tree directory
optimal binary sort tree
dynamic retieval
algorithm
