| 一种最佳二叉排序树的动态检索算法 |
| |
| 引用本文： | 黄水松,於朝晖,李世平.一种最佳二叉排序树的动态检索算法[J].武汉大学学报(理学版),2000,46(3):293-296. |
| |
| 作者姓名： | 黄水松 於朝晖 李世平 |
| |
| 作者单位： | 武汉大学,数学与计算机科学学院,武汉,430072 |
| |
| 摘 要： | 给出了一种最佳二叉排序树的动态检索算法，其性能优于二叉排序树和平衡二叉树，克服了用折半检索方法构造最佳二叉排序树的缺点，且不会因插入结点而发生蜕变，影响检索的性能．
|
| 关 键 词： | 树形目录 最佳二叉排序树，动态检索 算法 |
| 文章编号： | 0253-9888(2000)03-0292-04 |
| 修稿时间： | 1999-12-27 |
A Dynamic Retieval Algorithm of Optimal Binary Sort Tree |
| |
| HUANG Shui-song,YU Zhao-hui,LI Shi-ping.A Dynamic Retieval Algorithm of Optimal Binary Sort Tree[J].JOurnal of Wuhan University:Natural Science Edition,2000,46(3):293-296. |
| |
| Authors: | HUANG Shui-song YU Zhao-hui LI Shi-ping |
| |
| Institution: | HUANG Shui-song
,YU Zhao-hui
,LI Shi-ping
;(College of Mathematics and Computer Science, Wuhan University,Wuhan 430072,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | tree directory optimal binary sort tree dynamic retieval algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
