双向链表。

#include<stdio.h>
#include<malloc.h>
typedef struct DoubleLinkedNode
{
	char data;
	struct DoubleLinkedNode* previous;
	struct DoubleLinkedNode* next;
}DLNode,*DLNodePtr;
//初始化链表，返回头结点
DLNodePtr initLinkList()
{
	DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	tempHeader->data = '\0';
	tempHeader->previous = NULL;
	tempHeader->next = NULL;
	return tempHeader;
}
void printList(DLNodePtr paraHeader)
{
	DLNodePtr p = paraHeader->next;
	while (p != NULL)
	{
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");
}
//插入
void insertElement(DLNodePtr paraHeader, char paraChar, int paraPosition)
{
	DLNodePtr p, q, r;
	//1.找到插入位置
	p = paraHeader;
	for (int i = 0; i < paraPosition; i++)
	{
		p = p->next;
		if (p == NULL)
		{
			printf("The position %d is beyond the scope of the list", paraPosition);
			return;
		}
	}
	//2.创建一个新结点
	q = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	q->data = paraChar;
	//3.插入
	r = p->next;
	q->next = p->next;
	q->previous = p;
	p->next = q;
	if (r != NULL)
	{
		r->previous = q;
	}
}
//删除
void deleteElement(DLNodePtr paraHeader, char paraChar)
{
	DLNodePtr p, q, r;
	p = paraHeader;
	//1.定位
	while ((p->next != NULL) && (p->next -> data!=paraChar))
	{
		p = p->next;
	}
	//2.错误确认
	if (p->next == NULL)
	{
		printf("The char '%c' does not exit.\r\n", paraChar);
		return;
	}
	//3.删除
	q = p->next;
	r = q->next;
	p->next = r;
	if (r != NULL)
	{
		r->previous = p; 
	}
	//释放空间
	free(q);
}
//测试
void insertDeleteTest()
{
	//1.初始化一个空链表
	DLNodePtr tempList = initLinkList();
	printList(tempList);
	//2.增添一些字母
	insertElement(tempList, 'H', 0);
	insertElement(tempList, 'e', 1);
	insertElement(tempList, 'l', 2);
	insertElement(tempList, 'l', 3);
	insertElement(tempList, 'o', 4);
	insertElement(tempList, '!', 5);
	printList(tempList);
	//3.删除元素
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);
	//4.插入一个元素到指定位置
	insertElement(tempList, 'o', 1);
	printList(tempList);

}
void basicAddressTest()
{
	DLNode 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 ssecond node:%d,%d,%d\r\n", &tempNode2, &tempNode2.data, &tempNode2.next);
	tempNode1.next = &tempNode2;
}
void main()
{
	insertDeleteTest();
	basicAddressTest();
}

 运行结果：

图示：