# include <stdio.h>
# include <stdlib.h>
typedef struct NODE {
int data;
struct NODE * pNext;
}NODE, *pNODE;
pNODE creat_list(); //创建链表
void traverse(pNODE); //遍历链表
bool list_empty(pNODE ); //判断链表是否为空
int list_length(pNODE); //确定链表长度
void list_sort(pNODE); //链表的排序
int main() {
pNODE pHead = NULL;
pHead = creat_list();
traverse(pHead);
if (list_empty(pHead)) {
printf("链表为空链表");
} else {
printf("链表不为空\n");
int len = list_length(pHead);
printf("链表长度为%d\n", len);
}
list_sort(pHead);
traverse(pHead);
<