| 摘要: |
| 在分析二叉树的Create BTree算法的基础上,利用线性探测再散列方法对Create B-Tree算法的中序遍历序列进行预处理来改进Create BTree算法,使得改进后的Create BTree算法在最差情况下,时间复杂度由O(N2)降为O(N)。 |
| 关键词: 二叉树 CreateBTree算法 线性探测再散列 时间复杂度 |
| DOI： |
| 投稿时间：2003-03-26修订日期：2003-04-18 |
| 基金项目: |
|
| Improvement of Algorithm of CreateBTree for Generating Binary Trees |
|
Ling Guoxian
|
| (Finance Bureau of Management Committee, Liuzhou High tech Developing District, Liuzhou, 545005) |
| Abstract: |
| An algorithm of CreateBTree is analyzed. Its postorder traversal sequence is pretreated by using linear hashing.The time complexity of the improved algorithm goes down to O(N) from O(N2). |
| Key words: binary tree algorithm of CreateBTree linear hashing time complexity |
