b-树的增加,因为我看到的资料里的最大关键字数目为m-1,我考虑了一下,2-3树的删除会比较麻烦,后来看了下算法导论,别人的数目是2t-1,所以相同情况下是2-3-4树,我考虑按照这个因子再写一个,增加删除部分,有问题可以联系我,联系方式在程序中已注明.-b-tree increases, because the information I have seen in the largest number of keywords for the m-1, I consider a bit ,2-3 tree removal would be more trouble, after reading An Introduction to the next algorithm, the number of people are 2t-1, so the same circumstances are 2-3-4 tree, I consider this factor in accordance with the write one, delete some of the increase, has problem can contact me, Contact us in the proceedings have been marked.