创建动态链表

/*****************************************************
copyright (C), 2016-2017, Lighting Studio. Co.,     Ltd. 
File name：
Author：王    Version:0.1    Date: 
Description：
Funcion List: 
*****************************************************/

#include <stdio.h>
#include <stdlib.h>

struct node
{
	int num;
	char name[10];

	struct node * next;

};

typedef struct node Node;
typedef struct node * Link;

//创建空链表
void creat_link(Link * head)
{
	*head = NULL;
}

//头插创建链表
void insert_new_node_head(Link * head,Link new_node)
{
	new_node->next = *head;
	*head = new_node;
}

//尾插创建链表
void insert_new_node_tail(Link *head,Link new_node)
{
	Link p;
	p = *head;

	if(*head == NULL)
	{
		*head = new_node;
		new_node->next = NULL;
	}
	else
	{
		while(p->next != NULL)
			p = p -> next;
		if(p -> next == NULL)
		{
			p -> next = new_node;
			new_node-> next = NULL;
		}
	}
}

//创建新结点
void creat_new_node(Link * new_node)
{
	 
	*new_node = (Link)malloc(sizeof(Node));

	if(*new_node == NULL)
	{
		printf("malloc error!\n");
		exit(-1);
	}
}

//打印
void display(Link head)
{
	Link p;
	p = head;
	if(p == NULL)
	{
		printf("free success!\n");
		return;
	}
	while(p != NULL)
	{
		printf("num = %d,\t",p->num);
		printf("name is %s\n",p->name);
		p = p -> next;
	}
}

//释放内存
void free_node(Link * head)
{
	Link p;
	while(*head != NULL)
	{
		p = *head;
		*head = (*head)->next;
		free(p);

	}
}
int main()
{
	Link head = NULL;
	Link new_node = NULL;
	Link p = NULL;

	int i,n,m;

	creat_link(&head);


	printf("Enter the total:");
	scanf("%d",&m);
	printf("Enter the num and name:\n");

	for(i = 0;i < m;i++)
	{

		creat_new_node(&new_node);

		new_node->num = i+1;
		scanf("%s",new_node->name);
		insert_new_node_head(&head,new_node);
		insert_new_node_tail(&head,new_node);
	}

	display(head);

	free_node(&head);

	display(head);
        return 0;
}