Data Structure(with C).Experiment01.02

============algo2-2.h=========

#include<stdio.h>
#include<stdlib.h>

typedef struct LinkList{
	char data;
	LinkList *next;
}LinkList;

void InitList(LinkList *&L){
	L=(LinkList *)malloc(sizeof(LinkList));
	L->next=NULL;
}

void DestroyList(LinkList *&L){
	LinkList *pre=L,*p=pre->next;
	while(p!=NULL){
		free(pre);
		pre=p;
		p=p->next;
	}
	free(pre);
}

bool ListEmpty(LinkList *&L){
	return(L->next==NULL);
}

int ListLength(LinkList *&L){
	int n=0;
	LinkList *p=L;
	while(p->next!=NULL){
		n++;
		p=p->next;
	}
	return n;
}

void DispList(LinkList *&L){
	LinkList *p=L->next;
	while(p!=NULL){
		printf("%c ",p->data);
		p=p->next;
	}
	printf("\n");
}

bool GetChar(LinkList *&L,int i,char &e){
	int j=0;
	LinkList *p=L;
	while(j<i&&p!=NULL){
		j++;
		p=p->next;
	}
	if(p==NULL)
		return false;
	else{
		e=p->data;
		return true;
	}
}

int LocateChar(LinkList *&L,char e){
	int i=1;
	LinkList *p=L->next;
	while(p!=NULL&&p->data!=e){
		p=p->next;
		i++;
	}
	if(p==NULL)
		return 0;
	else
		return i;
}

bool ListInsert(LinkList *&L,int i,char e){
	int j=0;
	LinkList *p=L,*s;
	while(j<i-1&&p!=NULL){
		j++;
		p=p->next;
	}
	if(p==NULL)
		return false;
	else{
		s=(LinkList *)malloc(sizeof(LinkList));
		s->data=e;
		s->next=p->next;
		p->next=s;
		return true;
	}
}

bool ListDelete(LinkList *&L,int i){
	int j=0;
	LinkList *p=L,*q;
	while(j<i-1&&p!=NULL){
		j++;
		p=p->next;
	}
	if(p==NULL)
		return false;
	else{
		q=p->next;
		if(q==NULL)
			return false;
		p->next=q->next;
		free(q);
		return true;
	}
}

void CreateListR(LinkList *&L,char a[],int n){
	LinkList *s,*r;
	int i;
	L=(LinkList *)malloc(sizeof(LinkList));
	r=L;
	for(i=0;i<n;i++){
		s=(LinkList *)malloc(sizeof(LinkList));
		s->data=a[i];
		r->next=s;
		r=s;
	}
	r->next=NULL;
}

=============exp2-2=============

#include "algo2-2.h"
void main(){
	LinkList *L;
	char e,a[]={'a','b','c','d','e'};
	InitList(L);
	CreateListR(L,a,5);
	DispList(L);
	printf("The list-length is:%d\n",ListLength(L));
	if(ListEmpty(L))
		printf("The list is empty!\n");
	else
		printf("The list is not empty!\n");
	if(GetChar(L,3,e))
		printf("The third element of the list is:%c\n",e);
	else
		printf("The element is not found!\n");
	printf("The element a's location is:%d\n",LocateChar(L,'a'));
	ListInsert(L,4,'f');
	DispList(L);
	ListDelete(L,3);
	DispList(L);
	DestroyList(L);
}