双向链表

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

typedef struct NODE
{
    int num;
    struct NODE *pNext;
    struct NODE *pPrev;
}Node;

void createList(Node **pList);

int main()
{
    Node *p = NULL;
    createList(&p);
    while(p->pNext != NULL)
    {
        printf("%d\n",p->num);
        p = p->pNext;
    }
    printf("%d\n",p->num);
    while(p->pPrev != NULL)
    {
        printf("%d\n",p->num);
        p = p->pPrev;
    }
    printf("%d\n",p->num);

    return 0;
}

void createList(Node **pList)
{
    Node *w,
         *u;
    int shu;
    printf("璇疯緭鍏ヤ竴涓暟:");
    scanf("%d",&shu);
    while(shu != 0)
    {
        u = (Node*)malloc(sizeof(Node));
        u->num = shu;
        u->pNext = NULL;
        u->pPrev = NULL;
        if(NULL == *pList )
        {
            *pList = u;
        }
        else
        {
            u->pPrev = w;
            w->pNext = u;
        }
        w = u;
        printf("璇疯緭鍏ヤ竴涓暟:");
        scanf("%d",&shu);
    }

}