c语言描述的双向链表的基本操作

#include<stdio.h>
#include<stdlib.h>
#define ok 1
#define error 0
typedef int Status;
typedef char ElemType;
typedef struct node{
    int data;
    struct node *prior;
    struct node *next;
}Node;
Node * create(Node *L,int i){
    int n;
    int j=;
    Node *q=L;//保存头结点
    while(j<i){
        Node *p;
        p=(Node *)malloc(sizeof(Node));
        printf("请输入结点%d的data：\n",j);
        scanf("%d\n",&n);
        p->data=n;
        p->prior=q;
        p->next=NULL;
        q->next=p;
        q=p;
        j++;

    }
    return L;

}
Status Insert(Node *L,int i,int m){
    int j=;
    Node *p=NULL;
    while(j<i){
        L=L->next;
        j++;
    }
    p=(Node *)malloc(sizeof(Node));
    p->data=m;
    p->prior=L;
    p->next=L->next;
    L->next->prior=p;
    L->next=p;
    return ok;

}
void Traverse(Node *L){
    L=L->next;
    while(L){
        printf("%d ",L->data);
        L=L->next;
    }
}
void main(){
    int m=;
    Node *p=NULL;
    Node *L;
    L=(Node *)malloc(sizeof(Node));
    L->next=NULL;
    L->prior=NULL;
    p=create(L,m);
    Traverse(L);
    Insert(L,,);
    Traverse(L);
}