数据结构第二次作业（单链表）

#include <stdio.h>
#include <malloc.h>

typedef struct LinkNode {
	char data;
	struct LinkNode* next;
}LNode,*LinkList,*NodePtr;

LinkList initLinkList() {
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}
void printList(NodePtr paraHeader) {
	NodePtr p = paraHeader->next;
	while (p != NULL) {
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");
}

void appendElement(NodePtr paraHeader, char ParaChar) {
	NodePtr p, q;
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = ParaChar;
	q->next = NULL;
	p = paraHeader;
	while (p->next != NULL) {
		p = p->next;
	}
	p->next = q;

}

void insertElement(NodePtr paraHeader, char ParaChar, int paraPosition) {
	NodePtr q, p;
	p = paraHeader;
	int i; 
	for (i = 0; i < paraPosition; i++) {
		p = p->next;
		if (p == NULL) {
			printf("The position % d is beyond the scope of the list.", paraPosition);
			return;
		}
	}
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = ParaChar;
	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}

void deteleElement(NodePtr paraHeader, char paraChar) {
	NodePtr q, p;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->data != paraChar)) {
		p = p->next;
	}
	if (p->next == NULL) {
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}
	q = p->next;
	p->next = p->next->next;
	free(q);

}

void appendInsertDeletetest() {
	LinkList tempList = initLinkList();
	printList(tempList);

	appendElement(tempList, 'H');
	appendElement(tempList, 'e');
	appendElement(tempList, 'l');
	appendElement(tempList, 'l');
	appendElement(tempList, 'o');
	appendElement(tempList, '!');

	printList(tempList);

	deteleElement(tempList, 'e');
	deteleElement(tempList, 'a');
	deteleElement(tempList, 'o');

	printList(tempList);

	insertElement(tempList, 'o', 1);
	printList(tempList);
}

void basicAddressTest(){
	LNode tempNode1,tempNode2;
	
	tempNode1.data=4;
	tempNode1.next=NULL;
	
	tempNode2.data=6;
	tempNode2.next=NULL;
	
	printf("The first node: %d, %d, %d\r\n",
		&tempNode1, &tempNode1.data, &tempNode1.next);
	printf("The second node: %d, %d, %d\r\n",
		&tempNode2, &tempNode2.data, &tempNode2.next);

	tempNode1.next = &tempNode2;

}
int main() {
	
	appendInsertDeletetest();
	basicAddressTest();
	return 0;
}

运行结果