185. 연결 리스트 머리 삽입과 출력 순서

1#include <stdio.h>
2#include <stdlib.h>
3 
4struct Node {
5    char ch;
6    struct Node *next;
7};
8 
9int main(void) {
10    const char *s = "DOG";
11    struct Node *head = NULL, *n;
12    int i;
13    for (i = 0; s[i] != '\0'; i++) {
14        n = (struct Node *)malloc(sizeof(struct Node));
15        n->ch = s[i];
16        n->next = head;
17        head = n;
18    }
19    while (head != NULL) {
20        printf("%c", head->ch);
21        n = head;
22        head = head->next;
23        free(n);
24    }
25    printf("\n");
26    return 0;
27}