数据结构期末复习（ろく）--双向链表

#include <iostream>
using namespace std;
typedef struct DulNode
{
    int data;
    struct DulNode *next;  //后继节点
    struct DulNode *prior; //前驱节点
}DulNode,*DulLinkList;


void Creat_DLink(DulLinkList &L)  //尾插法创建单链表
{
    L = new DulNode;
    L->next=NULL;         //先建立一个带头结点的空链表
    DulLinkList p=L;   //中间变量
    int n;
    cout<<"1)你想输入多少数字？：";
    cin>>n;
    cout<<"请输入表数据,以空格隔开：";
    for(int i = 0;i<n;++i)
    {
        DulLinkList s = new DulNode; //中间变量
        cin>>s->data;  //将输入元素的值赋给s
        s->next=NULL;  //将新节点插入到头节点之后
        p->next=s;
        s->prior=p;
        p=s;
    }
    cout<<"建表成功
2)链表为：";
}

DulNode *GetElem(DulLinkList L,int i)  //取得第i个位置的位置指针p
{
    DulLinkList p = new DulNode;
    p=L->next;
    int j=1;
    while(p&&j<i) {
         p = p->next;
         ++j;
     }
     return p;
}

int Insert_DulLink(DulLinkList &L,int i,int e)  //插入
{
    DulLinkList p=new DulNode;
    DulLinkList s=new DulNode;
    p=GetElem(L,i);
    if(!p)
        return -1;
    s->data = e;
    s->next = p->next; p->next = s;
    s->next->prior = s; s->prior = p;
    return 0;

}

int Delete_DulLink(DulLinkList &L,int i) //删除
{
    DulLinkList p=new DulNode;
    p=GetElem(L,i);
    if(!p)
        return -1;
    p->prior->next=p->next;
    p->next->prior=p->prior;
    delete p;
    cout<<"删除成功
";
    return 0;
}

void Print_DLink(DulLinkList L)  //输出
{
    DulLinkList p=L->next;
    while(p) {
        cout<<p->data<<" ";
        p=p->next;
    }
    cout<<endl;
}

int main()
{
    DulLinkList L;
    int a,b;
    Creat_DLink(L);
    Print_DLink(L);
    cout<<"3)请输入要插入的位置和数值：";
    cin>>a>>b;
    Insert_DulLink(L,a,b);
    cout<<"插入后链表为：";
    Print_DLink(L);
    int i;
    cout<<"4)请输入要删除的位置：";
    cin>>i;
    Delete_DulLink(L,i);
    cout<<"删除后链表为：";
    Print_DLink(L);
    return 0;
}

编译结果如下：