数据结构各章实验源代码； 数据结构实验源代码

				#include  "datastru.h"
				#include  
				#include  
				
				void delete(LINKLIST *a){
				/*在无序单链表中删除重复元素,保留一个*/
				LINKLIST *la, *p, *q;
				
				la = a->next;
				while(la != NULL)
				 { q = la; p = la->next;
				   while(p != NULL)
				     {if (p->data == la->data)
				       { p = p->next; q->next = p;}
				      else { q = p; p = p->next;}
				     }
				   la = la->next;
				 }
				}
				
				int count_head(LINKLIST *head){
				/*带头结点的单链表: 输出单链表元素值并计数*/
				  int i = 0;
				  LINKLIST *p;
				  p = head->next;
				  printf("输出单链表元素值 : ");
				  while(p != NULL)
				   {i++;
				    printf("  %c",p->data);
				    p = p->next;}
				    printf("\n");
				    return i;
				}
				
				LINKLIST *creatlink_head_rail(LINKLIST *head){
				/*用尾插入法建立带头结点的单链表*/
				  LINKLIST *last, *t;
				  char ch;
				  
				  t = (LINKLIST *)malloc(sizeof(LINKLIST));
				  head = t;  last = t;
				  t->next = NULL;
				  printf("单链表元素值为单个字符, 连续输入，$为结束字符  : ");
				  while ((ch = getchar()) != '$')
				   {t = (LINKLIST *)malloc(sizeof(LINKLIST));
				    t->data = ch;
				    t->next = NULL;
				    last->next = t;
				    last = t;}
				  return (head);
				}
				
				main()
				{
				 LINKLIST *head = NULL;
				 int num;
				
				printf("\n    建立单链表\n\n");
				head = creatlink_head_rail(head);
				fflush(stdin);
				num = count_head(head);
				printf("\n    删除重复元素后\n\n");
				delete(head);
				num = count_head(head);
				}