综合2叉树及B+树优点的能根据增删改而分裂或合并的完整程序(现在以8bit(BYTE key)为关键字,可扩充到64bit的double为key,用户数据包现在以float ton表示,可扩充到任意结构struct)-Integrated 2-tree and B　 tree based on the merits of additions and deletions instead of splitting or merging of the integrity of the procedure (now to 8bit (BYTE key) for the keywords, can be expanded to 64bit the double for key, user data packets that now float ton , scalable to any structure struct)