数据结构例题库.doc

#include stdio.htypedef char DataType;typedef struct nodeDataType data;struct node *next;ListNode,*LinkList;LinkList CreatListF(void)char ch;LinkList head=(ListNode *)malloc(sizeof(ListNode);ListNode *s;ch=getchar();while(ch!=n)s=(ListNode *)malloc(sizeof(ListNode);s-data=ch;s-next=head-next;head-next=s;ch=getchar();return head;void Dowm(LinkList L)ListNode *p,*q,*s;p=L-next;q=p-next;p-next=NULL;while(q!=NULL)s=q-next; L-next=q;q-next=p;p=q;q=s;void InsertLink(LinkList L,DataType x)ListNode *p,*q,*s;int j;s=(ListNode *)malloc(sizeof(ListNode);s-data=x;p=L-next;while(p-datanext;if(p=NULL) j=1;break;if(j!=1)q-next=s;s-next=p;elseq-next=s;s-next=NULL;main()LinkList l;ListNode *p;l=CreatListF();Dowm(l);p=l-next;while(p!=NULL)printf(%c,p-data);p=p-next;return 0;#include stdio.htypedef int DataType;typedef struct nodeDataType data;struct node *next;ListNode,*LinkList;LinkList CreatListF(void)int ch;LinkList head=(ListNode *)malloc(sizeof(ListNode);ListNode *s;ch=getchar();while(ch!=n)s=(ListNode *)malloc(sizeof(ListNode);s-data=ch;s-next=head-next;head-next=s;ch=getchar();return head;void Dowm(LinkList L)ListNode *p,*q,*s;p=L-next;q=p-next;p-next=NULL;while(q!=NULL)s=q-next; L-next=q;q-next=p;p=q;q=s;void InsertLink(LinkList L,DataType x)ListNode *p,*q,*s;int j;s=(ListNode *)malloc(sizeof(ListNode);s-data=x;p=L-next;while(p-datanext;if(p=NULL) j=1;break;if(j!=1)q-next=s;s-next=p;elseq-next=s;s-next=NULL;main()LinkList l;ListNode *p;char x;l=CreatListF();printf(please the char:);scanf(%c,&x);InsertLink(l,x);p=l-next;while(p!=NULL)printf(%c,p-data);p=p-next;return 0;/*实现非空单链表的就地逆置*/#include /*单链表结点数据类型说明*/typedef char DataType;typedef struct node DataType data; struct node *next; ListNode,*LinkList;/*尾插法建立单链表*/LinkList CreatList()DataType ch;LinkList head;ListNode *s,*r;head=(ListNode *)malloc(sizeof(ListNode);r=head;while(ch=getchar()!=n)s=(ListNode *)malloc(sizeof(ListNode);s-data=ch;r-next=s;r=s;r-next=NULL;return head;/*链表元素输出运算PrintList(L)的实现*/void PrintList(LinkList L)ListNode *p; p=L-next; while(p!=NULL) printf( %c ,p-data); p=p-next; printf(n);/*对单链表进行就地逆置*/void invert(LinkList L)ListNode *p,*q,*s;p=L-next;q=p-next;p-next=NULL;while(q!=NULL)s=q-next;L-next=q;q-next=p;p=q;q=s;main()int i;LinkList La;clrscr();printf(please input some characters to creat List:);La=CreatList();PrintList(La);printf(the inverted result is:);invert(La);PrintList(La);getchar();#include #define M 10typedef structchar name10;char age10;int score;student;typedef struct student dataM;int length;s;void readdata(s *L)int i;L-length=0;for(i=0;,&L-datai.age,&L-datai.score);L-length+;main()s *stu;int scor,i;char nam10;printf(please input students message:n);readdata(stu);printf(The ages max is: ntnametscoren);for(i=0;ilength;i+)if(stu-datai.age=max)printf(t%st%dn,,stu-datai.score);#include stdio.h#define MaxLen 6typedef struct studentchar name20;int age;int score;datatype;typedef struct nodedatatype dataMaxLen;int length;Stu;Stu s;void input(Stu *x)int i;x-length=0;printf(Please input five student data:n);for(i=0;);printf(please input the Age :);scanf(%d,&x-datai.age);printf(please input the Score :);scanf(%d,&x-datai.score);x-length+;printf(complete!n);void out(Stu *x)int i;for(i=0;ilength;i+)printf(Name:);printf(%s,);printf(age:);printf(%d,x-datai.age);printf(score:);printf(%dn,x-datai.score);void oldfind(Stu *x)void average(Stu *x)void nameinput(Stu *x)main()int i,a;input(&s);oldfind(&s);average(&s);nameinput(&s);out(&s);#include stdio.h#include malloc.h#define NULL 0typedef int elemtype;typedef struct selemtype data;struct s *prior,*next;s;s* creat()int i,x;s *head,*p,*q;head=(s *)malloc(sizeof(s);head-prior=NULL;head-next=NULL;p=head;for(i=0;idata=x;q-next=p-next;q-prior=p;p-next=q;p=q;return head;void print(s *sq)int i;s* p;p=sq-next;while(p)printf(%dt,p-data);p=p-next;void insert(s *sq)int i;s *p,*x;p=sq-next;while(p)if(p-data=59)x=(s*)malloc(sizeof(s);x-data=JKN;p-next-prior=x;x-next=p-next;p-next=x;x-prior=p;p=x-next;else p=p-next;main()int i;s *sqx,*p,*x;printf(input 5 numbers:n);sqx=creat();printf(nthe sqlist is:n);print(sqx);insert(sqx);printf(nthe new sqlist is:n);print(sqx);/*利用已有基本运算，实现删除单链表中值为x的元素的函数void DL(LinkList L,DateType x)*/#include /*单链表结点数据类型说明*/typedef char DataType;typedef struct node DataType data; struct node *next; ListNode,*LinkList;/*查找运算locate(L,x)的实现(返回int值)*/int Locate(LinkList L,DataType x)ListNode *p=L-next;int i=1;while(p!=NULL & p-data!=x)p=p-next;i+;if(p=NULL) return 0; else return i;/*尾插法建立单链表*/LinkList CreatList()DataType ch;LinkList head;ListNode *s,*r;head=(ListNode *)malloc(sizeof(ListNode);r=head;while(ch=getchar()!=n)s=(ListNode *)malloc(sizeof(ListNode);s-data=ch;r-next=s;r=s;r-next=NULL;return head;/*链表元素输出运算PrintList(L)的实现*/void PrintList(LinkList L)ListNode *p; p=L-next; while(p!=NULL) printf( %c ,p-data); p=p-next; printf(n);/*求链表长度，在删除运算DeleteList(L,i)中需要用到*/int GetLength(LinkList L)int num=0; ListNode *p; p=L-next; while(p!=NULL) num+;p=p-next; return(num);/*链表的删除运算DeleteList(L,i)的实现，删除链表中的第i个元素*/void DeleteList(LinkList L,int i)int pos=1; ListNode *q=L,*p;if(iGetLength(L) exit(1); while(posnext; pos+; p=q-next; q-