数据结构链表为什么会有这么多错误，解答

Question

#include<stdio.h>
#include<stdlib.h>
#define ERROR 0
#define OK 1
typedef int status;
typedef int ElemType;

typedef struct LNode {
ElemType data;
struct LNode *next;

}LNode, *LinkList;

LinkList CreateList_L(LinkList L, int n) {
L = (LinkList)malloc(sizeof(LNode));
LinkList p;
L->next = NULL;
for (int i = n; i > 0; --i) {
p = (LinkList)malloc(sizeof(LNode));
printf("请输入第%d的值", i);
cin>>p->data;
p->next = L->next;
L->next = p;
}
}

status ListInsert_L(LinkList *L, ElemType i, int e) {
LinkList p = L,s;int j = 0;
while (p&&j < e - 1) {
p = p->next;
++j;
}
if (!p || j > e - 1) return ERROR;
s = (LinkList)malloc(sizeof(LNode));
s->data = i;
s->next = p->next;
p->next = s;
return OK;
}

status ListDelete_L(LinkList *L, int i) {
LinkList p = L,q; int j = 0;
ElemType e;
while (p->next&&j < i - 1) {
p = p->next;
++j;
}
if (!(p->next) || j > i - 1) return ERROR;
q = p->next;
p->next = q->next;
e = q->data;
free(q);
return OK;
}

status LocateElem_L(LinkList *L, ElemType e) {
LinkList p = L->next;
while (p&&p->data != e) {
p = p->next;
}
if (!p) return ERROR;
return OK;
}

void show_L(LinkList *L)
{
LinkList p=L->next;
while(p)
{
printf(p->data);
p=p->next;
}
}
int main()
{
LinkList q;
int n,i,m,a,b;
q=(LinkList)malloc(sizeof(LNode));
printf("请输入链表的长度：");
scanf("%d,&n);
CreateList_L(q, n);
show_L(q);

printf("请输入要查找的整数:");
scanf("%d",&i);
LocateElem_L(q, i);
show_L(q);

printf("请输入要删除的整数：");
scanf("%d",&m);
ListDelete_L(q, m);
show_L(q);

printf("请输入要插入的元素:");
scanf("%d",&a);
printf("请输入要插入的位置：");
scanf("%d",&b);
ListInsert_L(q, a, b);
show_L(q);

return 0;

}