数据结构单链表

单链表是一种链式存取的数据结构，用一组地址任意的存储单元存放线性表中的数据元素。链表中的数据是以结点来表示的，每个结点的构成：元素(数据元素的映象) + 指针(指示后继元素存储位置)，元素就是存储数据的存储单元，指针就是连接每个结点的地址数据。

代码：

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

/**
 *Linked list of characters.The key is data.
 */
typedef struct LinkNode{
	char data;
	struct LinkNode *next;
} LNode, *LinkList, *NodePtr;

/**
 *Initialize the list with a header.
 *@return The pointer to the header.
 */
LinkList initLinkList(){
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}

/**
 *Print the list.
 *@param paraHeader The header of the list.
 */
void printList(NodePtr paraHeader){
	NodePtr p = paraHeader->next;
	while (p!= NULL) {
		printf("%c",p->data);
		p = p->next;
	}
	printf("\r\n");
}

/**
 *Add an element to the tail.
 *@param paraHeader The header of the list.
 *@param paraChar The given char.
 */
void appendElement(NodePtr paraHeader, char paraChar){
	NodePtr p,q;
	
	//Step 1.Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;
	
	//Step 2.Search to the tail.
	p = paraHeader;
	while (p->next !=NULL) {
		p = p->next;
	}
	
	//Step 3. Now add/link.
	p->next = q;
}

/**
 *Insert an element to the given position.
 *@param paraHeader The header of the list.
 *@param paraChar The given char.
 *param paraPosition The given position.
 */
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition){
	NodePtr p,q;
	
	//Step 1.Search to the position.
	p = paraHeader;
	for (int i = 0; i < paraPosition; i ++) {
		p = p->next;
		if (p==NULL) {
			printf("The position %d is beyond the scope of list.",paraPosition);
			return;
		}
	}
	
	//Step 2. Construct a new node.
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	
	//Step 3. Now link.
	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
} 

/**
 *Delete an element from the list.
 *@param paraHeader The header of the list.
 *@param paraChar he given char.
 */
void deleteElement(NodePtr paraHeader, char paraChar) {
	NodePtr p,q;
	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);
}

/**
 *Unit test .
 */
void appendInsertDeleteTest(){
	//Step 1. Initialize an empty list.
	LinkList tempList = initLinkList();
	printList(tempList);
	
	//Step 2. Add some characters.
	appendElement(tempList,'H');
	appendElement(tempList,'e');
	appendElement(tempList,'l');
	appendElement(tempList,'l');
	appendElement(tempList,'o');
	appendElement(tempList,'!');
	printList(tempList);
	
	//Step 3. Delete some characters (the first occurrence).
	deleteElement(tempList,'e');
	deleteElement(tempList,'a');
	deleteElement(tempList,'o');
	printList(tempList);
	
	//Step 4. Insert to a given position.
	insertElement(tempList,'o',1);
	printList(tempList);
}

/**
 *Address test: beyond the book.
 */
void basicAddressTest(){
	LNode tempNode1,tempNode2;
	
	tempNode1.data= 4;
	tempNode1.next = NULL;
	
	tempNode2.data = 4;
	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;
}

/**
 *The entrance.
 */
 int main(){
 	appendInsertDeleteTest();
 }

定义单链表，分为两部分，一部分存储数据，另一部分为指针，指向下一结点
链表数据初始化，malloc函数开辟一个空间，然后使头结点的指针域为空
printList函数打印链表;
appendElement函数添加元素，构建一个新结点，搜索链表尾部，链接链表
insertElement函数插入元素，搜索插入位置，创建新结点，链接链表
deleteElement函数删除元素，最后使用free函数释放内存
appendInsertDeleteTest函数测试代码。

运行结果：

Hello!
Cannot delete a
Hll!
linking
Holl!