b-shu

说明：  定义B-树存储结构（要求m?3；为方便操作，结点中增加双亲结点指针域，最底层的Fail结点用NULL指针表示并且所有结点均存储于内存）。定义B-树插入关键字函数、删除关键字函数、查找关键字函数以及按层次遍历输出B-树所有结点的函数。主函数定义菜单(1.插入关键字 2.删除关键字 3. 查找关键字 4.层次遍历输出B-树所有结点 5.结束程序)。
(The B-tree storage structure is defined (3 is required; for the convenience of operation, the pointer field of the parent node is added in the node, the bottom fail node is represented by null pointer and all nodes are stored in memory). The functions of inserting key function, deleting key function, searching key function and traversing all nodes of output B-tree are defined. Main function definition menu (1. Insert keywords 2. Delete keywords 3. Search keywords 4. Traverse output B-tree all nodes 5. End program).)