数据结构第二次作业

"c

the code

"

#include<stdio.h>
#include<malloc.h>
typedef struct LinkNode
{
	char date;
	struct LinkNode* next;
}LNode,*LinkList,*NodePtr;
LinkList initLinkList()
{
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->date = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}
void printList(NodePtr paraHeader)
{
	NodePtr p = paraHeader->next;
	while (p != NULL)
	{
		printf("%c", p->date);
		p = p->next;
	}
	printf("\r\n");
}
void appendElement(NodePtr paraHeader, char parachar)
{
	NodePtr p, q;
	q = (NodePtr)malloc(sizeof(LNode));
	q->date = 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 p, q;
	p = paraHeader;
	for (int i = 0; i < paraPosition; i++)//p指向paraPosition的上一个
	{
		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->date = paraChar;
	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}
void deleteElement(NodePtr paraHeader, char paraChar)
{
	NodePtr p, q;
	p = paraHeader;
	while (p->next != NULL && p->next != 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);


	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);

	insertElement(tempList, 'o', 1);
	printList(tempList);
}
void basicAddressTest() {
	LNode tempNode1, tempNode2;

	tempNode1.date = 4;
	tempNode1.next = NULL;

	tempNode2.date = 6;
	tempNode2.next = NULL;

	printf("The first node: %p, %p, %p\r\n",
		&tempNode1, &tempNode1.date, &tempNode1.next);
	printf("The second node: %p, %p, %p\r\n",
		&tempNode2, &tempNode2.date, &tempNode2.next);

	tempNode1.next = &tempNode2;
}
int main() {
	appendInsertDeleteTest();
}

本文bug

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);

地址应用%p