수다닷컴

질문 제목 : 질문 내용 :

밑에 밑줄 친것좀 알려주세요.ㅠㅠ 이해가 안되요.ㅠㅠ

그림으로 해주시면 더 감사하겠습니다.ㅠㅠ 링크드 리스트인데..ㅠㅠ 책봐도 이해가 안되네요.ㅎㅎ

#includestdio.h
typedef struct _node{int key;struct _node *next;}node;
node *head, *tail;
void init_list(void){head = (node*)malloc(sizeof(node));tail = (node*)malloc(sizeof(node));head-next = tail;tail-next = tail;}
int delete_next(node *t){node *s;if(t-next == tail)return 0;s = t-next;t-next = t-next-next;free(s);return 1;}
node *insert_after(int k, node *t){node *s;s=(node*)malloc(sizeof(node));s-key = k;s-next=t-next;t-next = s;return s;}
node *find_node(int k){node *s;s=head-next;while(s-key !=k && s!=tail)s=s-next;return s;}
int delete_node(int k){node *s;node *p;p = head;s = p-next;while(s-key !=k && s!=tail){p=p-next;s=p-next;}if(s!=tail){p-next = s-next;free(s);return 1;}elsereturn 0;}
node *insert_node(int t, int k){node *s;node *p;node *r;p=head;s=p-next;while(s-key !=k && s!=tail){p=p-next;s=p-next;}if(s !=tail){r=(node*)malloc(sizeof(node));r-key = t;p-next = r;r-next = s;}return p-next;}
node *ordered_insert(int k){node *s;node *p;node *r;p=head;s=p-next;while(s-key=k && s!=tail){p=p-next;s=p-next;}r=(node*)malloc(sizeof(node));r-key=k;p-next=r;r-next =s;return r;}
void print_list(node *t){printf(\n);while(t!=tail){printf(%-8d, t-key);t=t-next;}}
node *delete_all(void){node *s;node *t;t=head-next;while(t!=tail){s=t;t=t-next;free(s);}head-next=tail;return head;}
void mail(){node *t;
init_list();ordered_insert(10);ordered_insert(5);ordered_insert(8);ordered_insert(3);ordered_insert(1);ordered_insert(7);ordered_insert(8);
printf(\ninitial linked list is);print_list(head-next);
printf(\nfinding 4 is %ssuccessful, find_node(4) == tail?un:);
t=find_node(5);printf(\nfinding 5 is %ssuccessful, t==tail? un:);
printf(\ninserting 9 after 5);insert_after(9,t);print_list(head-next;
t=find_node(10);printf(\ndeleting next last node);delete_next(t);print_list(head-next);
t=find_node(3);printf(\ndeleting next 3);delete_next(t);print_list(head-next);
printf(\ninset node 2 before 3);inset_node(2,3);print_list(head-next);
printf(\ndeleting node 2);if(!delete_node(2))printf(\n deleting 2 is unsuccessful);print_list(head-next);
printf(\ndeleting node 1);delete_all();/div();print_list(head-next);}

신청하기