main.cpp

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时

#include<iostream.h>
#include<conio.h>
#include"Btree.h"

void main()
{
	cout<<"请输入B_树的阶:"<<endl;
	int m;
	cin>>m;
	Btree<Data> bt(m);
	cin>>bt;
	cout<<endl;
	cout<<"请按任意键输出B_树:"<<endl;
	cout<<"B_树是:"<<endl;
	bt.print();
	cout<<endl;
	cout<<endl;
	cout<<"按任意键继续程序>"<<endl;
	getch();

	cout<<"输入要查找的键值:"<<endl;
	Data a;
	cin>>a.key;
	cout<<"要查找的键值对应的B_树结点的记录号为:"<<bt.GetRecord(a)<<endl;
	cout<<endl;
	cout<<endl;
	cout<<"按任意键继续程序>"<<endl;
	getch();

	cout<<"输入要查找的键值的范围.\n"<<endl;
	cout<<"请先输入查找范围的下限:"<<endl;
	Data b,c;
	cin>>b.key;
	cout<<"现在输入查找范围的上限:"<<endl;
	cin>>c.key;
	cout<<"该范围内的键值包括:"<<endl;
	bt.GetKeyRange(b,c);
	cout<<endl;
	cout<<endl;
	getch();
	cout<<"按任意键继续程序>"<<endl;
	getch();

    cout<<"输入要删除的键值:"<<endl;
	cin>>a.key;
	cout<<"\n删除前的B_树是:"<<endl;
	bt.print();
	getch();
	cout<<"被删的键值其对应的B_树结点的记录号为:"<<bt.Remove(a)<<endl;
	cout<<endl;
	cout<<"删除后的B_树为:"<<endl;
	bt.print();
	cout<<endl;
	cout<<endl;

}