双向链表及其基本操作

#include<stdio.h>
#include<stdlib.h>
typedef struct Line{
struct Line* prior;
int data;
struct Line* next;
}line;
line* initLine(line* head,int n)
{
head=(line*)malloc(sizeof(line));//没有头结点的双向链表
head->prior=NULL;
head->data=1;
head->next=NULL;
line* list=head;
for(int i=2;i<=n;i++)
{
line* body=(line*)malloc(sizeof(line));
body->data=i;
body->prior=list;//指向直接前驱
body->next=NULL;
list->next=body;//直接前驱链接新节点
list=list->next;
}
return head;
}
void display(line* head)
{
line* list=head;
while(list!=NULL)
{
printf("%d “,list->data);
list=list->next;
}
printf(”\n");
}
line* insertLine(line* head,int data,int index)