结构体和链表的应用.docVIP

结构体和链表的使用，结构体作为一个链表的结点使用 #includeiostream #includeiomanip #includestdlib.h using namespace std; struct IntNode { int data; IntNode *next; }; void creat(IntNode *f,int n); void creat1(IntNode *f,int n); void traverse(IntNode *f); void deletelise(IntNode *f); void creat(IntNode *f,int n) { if(n0) { coutendlThe varible n is below zero!; exit(1);//A System-Function has been called } if(n==0) { f=NULL; return; } coutendlPlease input n intgers for initialization!; coutendl; int x; cinx; f=new IntNode; f-data=x; f-next=NULL; if(n==1) { return; } else { IntNode *p=f; for(int i=1;i=n-1;i++) { cinx; p-next=new IntNode; p=p-next; p-data=x; } p-next=NULL; } } void creat1(IntNode *f,int n) { if(n0) { coutendlThe varible of n should be bigger than zero￡?; exit(1); } if(!n) { f=NULL; return; } coutPlease input n intgers for initialization !; coutendl; f=NULL; while(n--0) { IntNode *p=new IntNode; cinp-data; p-next=f; f=p; } } void traverse(IntNode *f) { while(f) { coutf-data ; f=f-next; } coutendl; } void deletelise(IntNode *f) { while(f) { IntNode *p=f; f=f-next; delete p; } } int main(void) { IntNode *head1=NULL,*head2=NULL; int n; coutendlPlease input the value for n; coutendl; cinn; creat(head1,n); traverse(head1); creat1(head2,n); traverse(head2); delete(head1); delete(head2); return 0; }