郝斌数据结构　　24　　链表创建和链表遍历算法的演示

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>typedef struct Node
{int data;               //数据域struct Node *pNext;     //指针域
}NODE,*PNODE;   //NODE等价于struct Node     PNODE等价于struct Node *PNODE creat_list(void);
void traverse_list(PNODE);
int main(void)
{PNODE pHead = NULL;     //等价于struct Node * pHead = NULL;pHead = creat_list();   //创建一个非循环链表,并将该链表的头结点的地址赋给pHeadtraverse_list(pHead);return 0;
}PNODE creat_list(void)
{int i;int len; //用来存放有效节点的个数int val; //用来临时存放用户输入的结点的值printf("请输入你需要生成的链表的节点个数:len = ");scanf("%d",&len);PNODE pHead = (PNODE)malloc(sizeof(NODE));//分配了一个不存放数据的头结点if(pHead == NULL){printf("内存分配失败,程序终止\n");exit(-1);}PNODE pTail = pHead;pTail->pNext = NULL;for(i=0; i<len; i++){printf("请输入第%d个节点的值:",i+1);scanf("%d",&val);PNODE pNew = (PNODE)malloc(sizeof(NODE));if(pNew == NULL){printf("内存分配失败,程序终止\n");exit(-1);}pNew->data = val;pTail->pNext = pNew;pNew->pNext = NULL;pTail = pNew;}return pHead;
}void traverse_list(PNODE pHead)
{PNODE p = pHead->pNext;while(p != NULL){printf("%d    ",p->data);p = p->pNext;}printf("\n");
}