链表入门代码

看B站郝斌老师视频，自己动手码的。
#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#include<string.h>
typedef struct student {
int data;
struct student* pNext;
}NODE, * PNODE;
PNODE create_list();
void reverse_list(PNODE);
int is_empty(PNODE pHead);
int length_list(PNODE pHead);
int insert_list(PNODE pHead, int pos, int val);
int delete_list(PNODE pHead, int pos, int* pVal);
int main()
{
int count = 0;
PNODE pHead = NULL;
pHead = create_list();
reverse_list(pHead);
if (is_empty(pHead))
{
printf(“链表非空\n”);
}
else
{
printf(“链表为空\n”);
}
count = length_list(pHead);
printf(“链表的长度是%d\n”, count);
return 0;
}
PNODE create_list()
{
int i;
int len;
int val;
PNODE pHead = (PNODE)malloc(siz