#include <stdio.h>
//List結構樣式
typedef struct node
{ int data;
struct node *next;
}Node;

//建立head的空鏈
Node *createList()
{
Node *head = (Node *)malloc(sizeof(Node));
if(NULL == head)
exit(-1);
head->next = NULL;
return head;
}

Node *insertList(Node *head,int i) //頭插法插入連結串列資料
{
Node *cur = (Node *)malloc(sizeof(Node));
cur->data = i;
cur->next = head->next;
head->next = cur;
return head;
}

void traverseList(Node *head) //將連結串列節點中的資料輸出
{
head = head->next;
while(head)
{
printf("%d\n",head->data);
head = head->next;
}
}

int main(void)
{
Node *head = createList(); //建立帶頭節點的空連結串列
for(int i =1; i<=10; i++)
insertList(head,i);
traverseList(head);
return 0;
}