head.h

图书管理系统 C**实现的 包括B树 可以参考一下呀 有需要联系我哈

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#define M 3
#define MAX 5
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define Status int
#define OK 1


typedef struct{
	int booknum;
	char name[20];
	char writer[20];
	int total;
	int current;
	char librarynum[MAX][MAX];
	char returndate[MAX][MAX];
}Record;

typedef struct
{
	int k;
	Record *recptr;
}KeyType;
typedef struct BTNode{
	int keynum;
	struct BTNode *parent;
	KeyType *key[M+1];
	struct BTNode *ptr[M+1];
	
}BTNode,*BTree;


typedef struct{
	BTNode *pt;
	int i;
	int tag;
}Result;


void GetInformation(Record &book);
void PrintBookInfomation(Record *book);
void Procurement(BTree &T);
void DeleteBook(BTree &T,int k);
void Lending(BTree &T,int k,char librarynum[10],char data[10]);
void Return(BTree &T,int k,char *librarynum);

void InitBTree(BTree &T);
int Search(BTree p,int k);
Result SearchBTree(BTree T,int k);
void split(BTree &q,int s,BTree &ap);
void Insert(BTree &q,int i,KeyType x,BTree ap);
void NewRoot(BTree &T,BTree q,KeyType x,BTree ap);
Status InsertBTree(BTree &T,KeyType k,BTree q,int i);
void FindSmallest(BTree p,BTree &q);
int Parent(BTree p);
void RightBrother(BTree p,BTree &right);
void LeftBrother(BTree p,BTree &left);
void LeftMove(BTree &p,int loc);
Status DeleteBTree(BTree &T,int k);
void PrintBTree(BTree T);