二叉树CreateBTree算法的改进

Improvement of Algorithm of CreateBTree for Generating Binary Trees

在分析二叉树的 Create BTree算法的基础上 ,利用线性探测再散列方法对 Create B-Tree算法的中序遍历序列进行预处理来改进 Create BTree算法 ,使得改进后的 Create BTree算法在最差情况下 ,时间复杂度由 O(N 2 )降为 O(N )。

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(N\+2)