线性表——链式存储

1 #include <stdio.h>
2 #include <stdlib.h>
3 typedef int ElemType;
4 typedef struct Node {   /*结点类型定义*/
5     ElemType data;
6     struct Node* next;
7 }Node, * LinkList;      /*Node*与LinkList为结构指针类型，两种类型等价*/

1 /*初始化单链表*/
2 LinkList InitList() {
3     LinkList L = (Node*)malloc(sizeof(Node));
4     L->next = NULL;
5     return L;
6 }

 1 /*单链表的头插法*/
 2 void CreateFromHead(LinkList L, ElemType e) {
 3     Node* s;
 4     s = (Node*)malloc(sizeof(Node)); 
 5     s->data = e;  
 6     s->next = L->next;  /*表为空L->next=null,将*/
 7     L->next = s;
 8 }
 9 int main() {
10     LinkList L = InitList();
11     CreateFromHead(L, 10);
12     CreateFromHead(L, 20);
13     CreateFromHead(L, 30);
14     CreateFromHead(L, 40);
15 
16     printf("单链表：");
17     printfList(L);
18     return 0;
19 }