#include #include struct node{ int data; struct node *next; }; int node_find(struct node *head, int key); void list_print(struct node *); void main(){ struct node a, b, c; struct node *head; int find, key; head=&a; a.data = 10; b.data = 20; c.data = 30; a.next= &b; b.next = &c; c.next = NULL; list_print(head); while(key!=-1) { printf("\n>>데이터 찾기\n찾고자 하는 데이터 : "); scanf("%d",&key); find = node_fi..
#include #include #include struct node { int data; struct node *next; }; struct node *node_insert(struct node *head, int cur_data,int insert_data); void list_print(struct node *); void main(){ struct node a, b, c; struct node *head; head=&a; a.data = 10; b.data = 20; c.data = 30; a.next= &b; b.next = &c; c.next = NULL; list_print(head); head = node_insert(head, 20, 5); list_print(head); } void l..
#include #include struct node { int data; struct node *next; }; struct node *node_add(struct node *head, int add_data); void list_print(struct node *); void main(){ struct node a, b, c; struct node *head; head=&a; a.data = 10; b.data = 20; c.data = 30; a.next= &b; b.next = &c; c.next = NULL; list_print(head); head = node_add(head, 50); list_print(head); } void list_print(struct node *head){ for(..
#include #include struct node { int data; struct node *next; }; struct node *create2(); struct node *node_del(struct node *head, int del); void list_print(struct node *); void main() { struct node a, b, c; struct node *head; head=&a; a.data = 10; b.data = 20; c.data = 30; a.next= &b; b.next = &c; c.next = NULL; list_print(head); head = node_del(head,10); list_print(head); head = node_del(head,20..
