단순연결리스트 - 3

#include<stdio.h> #include<stdlib.h> typedef int element; typedef struct node_list { element data; struct node_list * p; }node; void error(char * sentence){ fprintf(stderr, "%s \n", sentence); exit(1); } //when inserting betweet phead and node, Needing address of phead. node *create_node(node * head, node * phead, element data){ node *new_node = NULL; new_node = (node *)malloc(sizeof(node)); if (new_node == NULL){ error("MEMORY ERROR"); } if (head == NULL){ head = new_node; new_node->data = data; new_node->p =NULL; return new_node; } else if(phead == NULL) { new_node->p = head; new_node->data = data; head = new_node; return new_node; } else { new_node->p = phead->p; phead->p = new_node; new_node->data = data; return new_node; } } void display(node *head){ node *p1 = head; while (p1 != NULL){ printf("%d->", p1->data); p1 = p1->p; } } node *search(node *head, int val){ node *p1 = head; if (p1 == NULL){ error("fail"); } while (p1 !=NULL){ if (p1->data = val){ return p1->p; p1 = p1->p; } } return NULL; } int main(void){ node *list1 = NULL; list1 = create_node(list1, NULL, 10); list1 = create_node(list1, NULL, 20); list1 = create_node(list1, NULL, 30); display(list1); return 0; }