입출력은 구현하지 않았음.

리스트 순회하기는 for문을 보라.

#include <stdio.h> 

#include <stdlib.h> 

typedef struct{ 

    int number; 

    int point; 

}data;

struct node{ 

    data mydata; 

    struct node* Next; 

    struct node* Prev; 

};

typedef struct node NODE; 

NODE *Head, *Tail; 

void append_a_node(NODE *); 

void insert_a_node(NODE *, NODE *); 

void remove_a_node(NODE *); 

void delete_all_node(void); 

void init_node(void); 

int main(void) { 

    NODE *mynode; 

    init_node(); 

    /* add some numbers to the double linked list */ 

    mynode = (NODE *)malloc(sizeof(NODE)); 

    mynode->mydata.number = 99; 

    mynode->mydata.point = 88; 

    append_a_node(mynode); 

    /* print the list */ 

    for(mynode = Head->Next; mynode->Next != NULL; mynode = mynode->Next) { 

        printf("%d\\n", mynode->mydata.number);  

        printf("%d\\n", mynode->mydata.point); 

    } 

    /* destroy the list */ 

    delete_all_node();

    return 0; 

} 

void append_a_node(NODE *mynode) { 

    insert_a_node(mynode, Tail); 

} 

void insert_a_node(NODE *mynode, NODE *after) { 

    if(after->Prev == NULL) 

            return; 

    mynode->Prev = after->Prev; 

    mynode->Next = after; 

    after->Prev = mynode; 

    mynode->Prev->Next = mynode; 

} 

void delete_all_node() 

{ 

    while(Head->Next != Tail) 

            remove_a_node(Head->Next); 

    free(Head); 

    free(Tail); 

} 

void remove_a_node(NODE *mynode) { 

    if(mynode->Prev == NULL || mynode->Next == NULL) 

            return; 

    mynode->Next->Prev = mynode->Prev; 

    mynode->Prev->Next = mynode->Next; 

    free(mynode); 

} 

void init_node(void) 

{ 

    Head = (NODE *)malloc(sizeof(NODE)); 

    Tail = (NODE *)malloc(sizeof(NODE)); 

    Head->Prev = NULL; 

    Head->Next = Tail; 

    Tail->Prev = Head; 

    Tail->Next = NULL; 

}