摘要
在最优二叉树的证明中,一般是从该树中通路长度最长的分枝点有两个孩子开始证明,但却并没有在前提条件中给出在最优二叉树中通路长度最长的分枝点一定有两个孩子,本文就此问题进行证明;另外给出最优二叉树的一个性质;最优二叉树一定是完全二叉树,并给予证明.
While demonstrating the optimal B-tree,the demonstration is usually started from a point that there are two children on the diving-branch point where the length of the route is the longest,but seldom demonstrates there are certainly two children on that diving-branch point.This article demonstrates this problem and also demonstrates a nature of optimal B-tree:optimal B-tree is certainly a complete two-branches tree.
出处
《吉林化工学院学报》
CAS
2004年第2期100-101,共2页
Journal of Jilin Institute of Chemical Technology
