双链表基本方法代码实现

#include<stdio.h>
#include<stdlib.h>

//双向列表结构体
typedef struct LNode{
    int data;
    LNode *prior,*next;
}Lnode,*LinkList;

//初始化增加头节点，并把前后指针都置为空
void InitList(LinkList &l){
    l = (Lnode*) malloc(sizeof(LNode));
    l->next = NULL;
    l->prior = NULL;
    l->data=NULL;
}

//判断双链表是否为空
bool Empty(LinkList &l){
    if(l->next==NULL)return true;
    else return false;
}

//在p节点之后插入q节点
bool InsertP(LinkList &l,LNode *p,Lnode *q){
    if(p==NULL||q==NULL) return false;
    q->next = p->next;
    if(p->next!=NULL)
        p->next->prior = q;
    q->prior = p;
    p->next = q;
    return true;
}

//删除p节点之后的指针
bool DeletePBehind(LinkList &l,LNode *p){
    if(p==NULL)return false;
    Lnode *q = p->next;
    //在倒数第二个节点和倒数第一个节点的情况下都需要特殊处理
    if(q==NULL)return false;
    p->next = q->next;
    if(q->next!=NULL)
        q->next->prior = p;
    free(q);
    return true;
}

void Print(LinkList l){
    Lnode *p = l->next;
    while(p!=NULL) {
        printf("%d ", p->data);
        p = p->next;

    }
    printf("\n");
}

//前插建立新链表
LinkList InsertHead(LinkList &l){
    int x;
    InitList(l);
    scanf("%d",&x);
    while(x!=9999) {
        Lnode *s = (Lnode*) malloc(sizeof(Lnode));
        s->data = x;
        s->next = l->next;
        if (l->next != NULL)
            l->next->prior = s;
        s->prior=l;
        l->next = s;
        scanf("%d",&x);
    }
    return l;
}

//尾插法建立新链表
LinkList InsertTail(LinkList &l){
    InitList(l);
    Lnode *s,*t = l;
    int x;
    scanf("%d",&x);
    while(x!=9999){
        s = (Lnode*)malloc(sizeof(Lnode));
        s->data = x;
        s->next = t->next;
        s->prior = t;
        t->next = s;
        t = s;
        scanf("%d",&x);
    }
    t->next = NULL;
    return l;
}

int main(){
    LinkList l;
    InitList(l);
    InsertHead(l);
    Print(l);
    InsertTail(l);
    Print(l);
    return 0;
}