数据结构自学记录(三):双链表

代码实现:

//双链表操作
//双链表的结构体
#include <bits/stdc++.h>
typedef struct DNode *ptrDLinkList;
typedef struct DNode
{
    int data; //以int为例
    ptrDLinkList prior;
    ptrDLinkList next;
} DLinkList;

//头插法建立双链表
void CreateListF(ptrDLinkList &L, int a[], int n)
{
    ptrDLinkList s;
    int i;
    L = (ptrDLinkList)malloc(sizeof(DLinkList));
    L->next = L->prior = NULL;
    for (itn i = 0; i < n; i++)
    {
        s = (ptrDLinkList)malloc(DLinkList);
        s->data = a[i];
        s->next = L->next;
        if (L->next != NULL)
            L->next->prior = s;
        L->next = s;
        s->prior = L;
    }
}

//尾插法建立双链表
void CreateListR(ptrDLinkList &L, int a[], int n)
{
    ptrDLinkList s, r;
    int i;
    L = (ptrDLinkList)malloc(sizeof(DLinkList));
    r = L;
    for(i = 0;i < n;i++)
    {
        s = (ptrDLinkList)malloc(sizeof(DLinkList));
        s ->data = a[i];
        r ->next = s;
        s ->prior = r;
        r = s;
    }
    r ->next = NULL;
}

//和单链表相比,主要是插入和删除的运算不同   

//双链表的插入算法
bool ListInsert(ptrDLinkList &L,int i,int ele)
{
    int j = 0;
    ptrDLinkList s,p;
    p = L;
    //查找第i-1个节点
    while(j < i-1 && p->next != NULL)
    {
        j++;
        p = p->next;
    }
    if(p == NULL)
        return false; //没有找到第i-1个节点
    else
    {
        s = (ptrDLinkList)malloc(sizeof(DLinkList));
        s->data = ele;
        s->next = p->next;
        if(p->next != NULL)
            p->next->prior = s;
        s->prior = p;
        p->next = s;
        return true; 
    }
}

//双链表的删除
bool ListDelete(ptrDLinkList &L,int i,int &e) //e用来保存被删除的结点
{
    int j = 0;
    ptrDLinkList p,q;
    p = L;
    //查找第i-1个结点
    while(j < i -1 && p != NULL;)
    {   
        j++;
        p = p->next;
    }
    if( p == NULL)
        return false;
    else
    {
        q = p->next;
        if(q == NULL)
            return false;
        e = q ->data;
        p->next = q->next;
        if(p->next!=NULL)
            P->next->prior = p;
        free(q);
        return false;
    }
}

//算法设计,双链表的逆置
//使用头插法,Reverse
void Reverse(ptrDlinke)
{
    ptrDLinkList p,q;
    p = L->next;
    L->next = NULL;
    while(p != NULL)
    {
        q = p->next; //保存后继结点
        p->next = L->next;
        if(L-next != NULL)
            L->next->prior = p;
        L->next = p;
        p->prior = L;
        p = q;
    }
}