void InsertList(List L,int data){
Node *p;
p = (List)malloc(sizeof(Node));
p ->data = data;
p ->next = L;
p ->prior = L ->prior;
L ->prior ->next = p;
L ->prior = p;
双向链表的插入（头插法）