数据结构-双链表

#include <iostream>
#include <stdlib.h>
using namespace std;

typedef struct DLNode
{
    int data;
    struct DLNode *prior;
    struct DLNode *next;
}DLNode;

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

void PrintD(DLNode *L)
{
    DLNode *p;
    p=L->next;
    while(p!=NULL)
    {
        cout<<"  "<<p->data<<"  ";
        p=p->next;
    }
}

DLNode* SearchNode(DLNode *L,int x)
{//查找结点值为x的结点，若找到，则返回结点指针；否则返回NULL
    DLNode *p=L->next;
    while(p!=NULL)
    {
        if(p->data==x)
            break;
        p=p->next;
    }
    return p;
}

int main()
{
    DLNode *L,*loc;
    int a[10]={1,2,3,4,5,6,7,8,9,10},n=10;
    int x=5;
    cout<<"
------------------------------------"<<endl;
    cout<<"待建表的元素序列为：
";
    for(int i=0;i<n;++i)
        cout<<"  "<<a[i]<<"  ";

    cout<<"
------------------------------------"<<endl;
    cout<<"双链表中的元素序列为：
";
    CreateDRear(L,a,n);
    PrintD(L);

    cout<<"
------------------------------------"<<endl;
    cout<<"查找双链表中的元素"<<x<<"的结点指针为： ";
    loc=SearchNode(L,x);
    cout<<loc<<endl;

    return 0;
}