C语言链表反向打印与反转_数据结构反向打印-优快云博客

本文链接：https://blog.youkuaiyun.com/bad7code/article/details/46428061

本文介绍了一个简单的链表创建过程，并演示了如何遍历显示链表元素，还提供了链表的逆序打印方法及实现链表反转的具体步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
using namespace std;

typedef struct node{
	int data;
	struct node *next;
}node;

node * ListCreate(){
	node *pHead = (node *)malloc(sizeof(node));
	if(pHead == NULL){
		printf("create list failed\n");
		return NULL;
	}
	pHead->data = 10;
	pHead->next = NULL;
	node *pTail = pHead;
	for(int i=0; i<10; i++){
		node *pTemp = (node *)malloc(sizeof(node));
		pTemp->data = rand()%100;
		pTemp->next = NULL;
		pTail->next = pTemp;
		pTail = pTemp;
	}
	return pHead;
}
void TarverseList(node *pHead){
	if(pHead == NULL){
		return;
	}
	node *pNode = pHead;
	while(pNode != NULL){
		printf("%d\n", pNode->data);
		pNode = pNode->next;
	}
}
void ReversePrintList(node *pHead){
	if(pHead == NULL){
		return;
	}
	ReversePrintList(pHead->next);
	printf("%d\n", pHead->data);
}
node * ReverseList(node *pHead){
	node *prevNode = NULL;
	node *pReverseHead = prevNode;
	node *pNode = pHead;
	while(pNode != NULL){
		node *pNextNode = pNode->next;
		if(pNextNode == NULL){
			pReverseHead = pNode;
		}
		pNode->next = prevNode;
		prevNode = pNode;
		pNode = pNextNode;
	}
	return pReverseHead;
}

int main(){
	node *pHead = ListCreate();
	TarverseList(pHead);
	printf("after reverse\n");
	ReversePrintList(pHead);
	printf("after reverse\n");
	node *pReverseHead = ReverseList(pHead);
	TarverseList(pReverseHead);
	return 0;
}