#include <stdio.h>
#define MAXSIZE 7
/////////聲明新的類型
typedef void Status;
typedef int ElemType;
typedef struct{
	ElemType Number;
    ElemType QNumber;
	ElemType XNumber;
	
}LNode;
LNode  Data[MAXSIZE];
typedef  struct LSNode{
	ElemType Number;
    ElemType QNumber;
	ElemType XNumber;
    struct LSNode *next;
}LSNode,*LinkList;
//
typedef struct BiTree{
	ElemType data;
	struct BiTree *Lchild, *Rchild;
}BiTree,*BLinkList;
//
///////給文件追加新的信息
Status Input(int &j)
{
   FILE *fp;   int i;
   LNode Data[MAXSIZE];
   printf("請(qǐng)輸入要追加信息的條數(shù):");
   scanf("%d",&j);
   for (i=0;i<j;i++)
   scanf("%d %d %d",&Data[i].Number,&Data[i].QNumber,&Data[i].XNumber);
   if((fp=fopen("information.dat","a"))==NULL)
   printf("Can't open file!");
   else  for(i=0;i<j;i++)
   fwrite(&Data[i],sizeof(LNode),1,fp);
   fclose(fp);
}
///////把文件的內(nèi)容存到鏈表里
Status StoreLNode(LinkList &L)
{

	FILE *fp;   int i;  LNode Data[MAXSIZE];
	L=(LinkList)malloc(sizeof(LSNode));
	LinkList S,P;   P=L;
	if((fp=fopen("information.dat","r"))==NULL)   
		printf("Can't open the file!");
	else 
	  for(i=0;i<MAXSIZE;i++){
	  fread(&Data[i],sizeof(LNode),1,fp);
	  S=(LinkList)malloc(sizeof(LSNode));
	  S->Number=Data[i].Number; S->QNumber=Data[i].QNumber;  S->XNumber=Data[i].XNumber;  
	  P->next=S;   P=S;  }
	  P->next=NULL;
	fclose(fp);
}
/////輸出鏈表內(nèi)容
Status Print(LinkList L)
{
	LinkList S;
	S=L->next;
	printf("鏈表內(nèi)容為：\n");
	while(S!=NULL){
		 printf("%d %d %d\n",S->Number,S->QNumber,S->XNumber);
		 S=S->next;}
}
/////建立二叉樹
Status PBiTree(BLinkList &S,LinkList L)
{
   
}
/////打印菜單
Status Menu(Status)
{
	printf("***********************\n");
	printf("***0.退出程序**********\n");
	printf("***1.給文件追信息******\n");
	printf("***2.對(duì)信息的一些操作**\n");
	printf("***********************\n\n");
}