//by?syj?and?wzq
//2013.11

#include?
#include?
#include?
#include?
#include?
#define?T?40		??//如果樹是三層的話可以放?40*40*40=64000?個記錄
#define?KeyType?int
#define?Pointer?int
#define?path_database??“.\\table\\datafile.txt“?
FILE?*?datafp?;?//指向datafile.txt
char?a1[9];
unsigned?int?record_num?=0;//記錄記錄的個數(shù)
//節(jié)點結構體
typedef?struct?BPNode
{
	unsigned?int?id;//記錄這個節(jié)點在文件的中的編號
	unsigned?int?n;	//記錄這個節(jié)點有多少個關鍵字
	int?leaf;		//判斷是否為頁節(jié)點
	KeyType?key[2*T];//關鍵字（及對應每個孩子節(jié)點的中關鍵字最小的關鍵字）
	Pointer?child[2*T];//指針，記錄每個孩子在文件的第幾個位置
	Pointer?next;//指針，，記錄下一個兄弟
}BPNode*P_BPNode;
char?a[9];
//記錄結構體
typedef?struct?Record
{
????Pointer?pos;??//記錄這個記錄在文件中的編號??即B+tree?葉子節(jié)點是child?指針值
	char?id[10];?//最大9
	char?lastname[16];//15
????char?firstname

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件??????15646??2013-12-19?15:40??B+樹\btree.cpp

?????文件???????3393??2013-11-28?22:39??B+樹\btree.dsp

?????文件????????535??2013-11-28?22:39??B+樹\btree.dsw

?????文件??????50176??2013-12-19?16:11??B+樹\btree.ncb

?????文件??????53760??2013-12-19?16:11??B+樹\btree.opt

?????文件????????659??2013-12-19?02:21??B+樹\btree.plg

?????文件??????91136??2013-12-01?14:59??B+樹\Debug\btree.bsc

?????文件?????233514??2013-12-01?14:59??B+樹\Debug\btree.exe

?????文件?????800428??2013-12-01?14:59??B+樹\Debug\btree.ilk

?????文件??????37233??2013-12-19?02:21??B+樹\Debug\btree.obj

?????文件?????623616??2013-12-01?14:59??B+樹\Debug\btree.pdb

?????文件??????30097??2013-12-19?02:21??B+樹\Debug\btree.sbr

?????文件??????50176??2013-12-19?02:21??B+樹\Debug\vc60.idb

?????文件??????69632??2013-12-19?02:21??B+樹\Debug\vc60.pdb

?????文件????3800153??2013-12-19?02:19??B+樹\table\datafile.txt

?????文件?????840344??2013-12-19?02:20??B+樹\table\student.sid

?????目錄??????????0??2014-02-12?11:25??B+樹\Debug

?????目錄??????????0??2013-11-30?22:06??B+樹\table

?????目錄??????????0??2013-12-19?16:11??B+樹

-----------?---------??----------?-----??----

??????????????6700498????????????????????19