摘要
引入构造类似Huffman树的理念,优化调整经典的次优查找树。假定查找成功和不成功都是非等概率的,拓宽对平均查找长度的计算,从而计算真实的次优查找树查找长度为查找成功的长度和查找不成功长度之和。
It＇ s necessary to optimize and adjust classic subprime search tree by introducing the idea of structuring Huffman tree. Assuming that both successful search and failed search have unequal probability, it is suggested to broaden the calculation of average search length to calculate the real search length of subprime search tree that is the total of successful search length and unsuccessful search length.
出处
《扬州职业大学学报》
2012年第3期36-38,共3页
Journal of Yangzhou Polytechnic College
