9-2课后练习+实验内容参考答案.docVIP

实验-2单链表 【实验目的】 掌握 掌握 熟练掌握遍历链表操作 掌握带有头结点的链表与不带有头结点的链表的区分 【实验内容】 Part1：基础练习（课堂练习） //linklist #include stdio.h #include stdlib.h #define NULLELEM \0 typedef char elemtype; struct node //结点数据类型 { elemtype data; struct node *next; }; int Length(struct node * head); int IsEmpty(struct node * head); int Locate (struct node * head, elemtype x); elemtype Find(struct node * head, int i); elemtype Next(struct node * head, elemtype x); elemtype Previous(struct node * head, elemtype x); void Traverse(struct node * head); void CreateFromHead(struct node **head); main() { struct node * head=NULL, *p; int no; elemtype x; CreateFromHead(head); printf(\nLength:\nthere are %d nodes in this linklist.\n, Length(head)); printf(\nTraverse:\nthey are : ); Traverse(head); no = Locate(head, D); printf(\nLocate:\nD node is at position %d.\n, no); x=Find(head, 3); if(x) printf(\nFind:\nnode at position 3 is %c.\n, x); x=Next(head, x); if(x) printf(\nNext:\nthe next node is %c.\n, x); x=Previous(head, x); if(x) printf(\nPrevious:\nthe previous node is %c.\n, x); //释放资源 while(head) { p = head; head = head -next; free(p); } } int Length(struct node * head) { //遍历 struct node *p=head; int n=0; while(p) { n++; p = p-next; } return(n); } int IsEmpty(struct node * head) { if(head == NULL) return 1; return 0; } int Locate (struct node * head, elemtype x) { struct node *p=head; int i, n = 0, size; size = Length(head); for(i=0; isize; i++) { n++; if(p-data == x) break; p = p-next; } if(isize ) return (n); else return (0); } elemtype Find(struct node * head, int i) { struct node *p=head; int n=0; while(p) { n++; if (n == i ) return (p-data); p=p-next ; } return NULLELEM; } elemtype Next(struct node * head, elemtype x) { struct node *p=head; while(p) { if(p-data == x p-next != NULL) return (p-next-data); p=p-next; } return NULLELEM; } elemtype Previous(struct node * h