이중 연결 리스트 시험

#include <stdio.h> #include <stdlib.h> typedef int element; typedef struct Dlist{ element data; struct Dlist * Llink; struct Dlist * Rlink; }nnode; void error (char * sentence){ fprintf(stderr,"%s\n",sentence); exit(1); } void init(nnode * head){ head ->Llink = head; head ->Rlink = head; } void insert_nnode (nnode * phead, nnode * new_node){ new_node -> Llink = phead; new_node -> Rlink = phead -> Rlink; phead ->Rlink->Llink = new_node; phead ->Rlink = new_node; } void display (nnode * head){ nnode * p; for ( p = head -> Rlink; p != head; p = p-> Rlink){ printf("%d->", p -> data); } } int main(void){ nnode list1; nnode * p[5]; int i; init(&list1); for ( i = 0; i <4; i++){ p[i] = (nnode *)malloc(sizeof(nnode)); p[i] -> data = i + 10; insert_nnode(list1.Rlink, p[i]); } display(&list1); return 0; }