摘要
对严格平衡二叉排序树的查找时间复杂度进行了详细分析,给出了平均查找长度的计算公式及其渐进性态的误差估计。基于C++语言的模板,提出了严格平衡二叉排序树类属类的总体设计方案及主要成员函数的详细设计。最后提出了有关严格平衡二叉排序树平均查找长度近似计算的绝对误差的一个猜想,以及有关广义严格平衡二叉排序树的一种构想。
The search time complexity of strict balanced binary sort tree is analyzed in detail,and the average search length formula and its error estimate for asymptotic behavior are given.Based on C＋＋ language template,we put forward general design scheme for a generic class of the strict balanced binary sort tree and detailed design for main member functions.Finally,we present a conjecture for absolute error of approximate calculation about the average search length of the strict balanced binary sort tree and a new conception of generalized strict balanced binary sort tree.
出处
《计算机时代》
2011年第5期1-4,共4页
Computer Era
关键词
严格平衡二叉排序树
平均查找长度
模板
类属类
strict balanced binary sort tree
average search length
template
generic class
