链表（基础）理解

1 #include <stdio.h>
2
3 typedef struct node
4 {
5 int item;
6 struct node *next;
7 }node_t;
8
9 node_t *head = NULL;
10
11 int main()
12 {
13 node_t n1 = {1, NULL};
14 node_t n2 = {2, &n1};
15 node_t n3 = {3, &n2};
16 node_t n4 = {4, &n3};
17 node_t n5 = {5, &n4};
18 node_t n6 = {6, &n5};
19 head = &n6;
20 node_t *p = head;
21
22 while(p != NULL)
23 {
24 printf("%d “, p->item);
25 p = p->next;
26 }
27 printf(”\n");
28 return 0;
29 }