带头结点的链表

<span style="font-size:18px;">#include <stdio.h>
#include <stdlib.h>
struct student
{
	int num;
	struct student * next;
};

typedef struct student STU;
typedef struct student * Link;

void create_newnode(Link *newnode);
void create_link(Link *head);
void is_malloc_ok(Link newnode);
void insert_newnode(Link *head,Link newnode);
void display(Link head);
void freelink(Link *head);
void insert_newnode_mid(Link *head,Link *newnode,int num);
void reverslink(Link *head);

void create_newnode(Link *newnode)
{
	*newnode = (Link)malloc(sizeof(STU));
	is_malloc_ok(*newnode);
}

void create_link(Link *head)
{
	create_newnode(head);
	(*head)->next = NULL;
}

void is_malloc_ok(Link newnode)
{
	if(newnode == NULL)
	{
		printf("malloc error !\n");
		exit(-1);
	}
}

void insert_newnode(Link *head,Link newnode)
{
		newnode->next = (*head)->next;
		(*head)->next = newnode;
}

void display(Link head)
{
	Link temp;
	temp = head->next;
	if(head->next != NULL)
	{
		while(temp->next != NULL)
		{
			printf("number = %d \n",temp->num);
			temp = temp->next;
		}

		if(temp->next == NULL)
		{
			printf("number = %d \n",temp->num);
		}
	}
}

void freelink(Link *head)
{
	Link temp;
	temp = (*head)->next;
	if((*head)->next == NULL)
	{
		printf("only head !\n");
		return;
	}
	while((*head)->next != NULL)
	{
		temp = (*head)->next;
		(*head)->next = temp->next;
		free(temp);
	}
	printf("free successfully !\n");

}

void insert_newnode_mid(Link *head,Link *newnode,int num)
{
	Link p1;
	Link p2;
	p1 = (*head)->next;
	p2 = (*head);
	if((*head)->next == NULL)
	{
		(*newnode)->next = NULL;
		(*head)->next = *newnode;
	}
	else
	{
		while((p1->num < num) && (p1->next != NULL))
		{
			p2 = p1;
			p1 = p1->next;
		}
		if(p1->next == NULL)
		{
			if(p1->num > num)
			{
				(*newnode)->next = p1;
				p2->next = *newnode;
			}
			else
			{
				p1->next = *newnode;
				(*newnode)->next = NULL;
			}
		}
		else
		{
			p2->next = *newnode;
			(*newnode)->next = p1;
		}
	}
}

void reverslink(Link *head)
{
	Link p1 = NULL;
	Link p2 = NULL;
	Link p3 = NULL;
	p1 = (*head)->next;
	if(p1 == NULL)
	{
		printf("Link is empty !\n");
		return;
	}
	if(p1->next == NULL)
	{
		return;
	}
	else
	{
		p2 = p1->next;
		if(p2->next == NULL)
		{
			(*head)->next = p2;
			p2->next = p1;
			p1->next = NULL;
		}
		else
		{
			p3 = p2->next;
			while(p3->next != NULL)
			{
				p2->next = p1;
				p1 = p2;
				p2 = p3;
				p3 = p3->next;
			}
			p2->next = p1;
			p3->next = p2;
			p1 = (*head)->next;
			p1->next = NULL;
			(*head)->next = p3;

		}
	}


}
int main()
{
    Link head = NULL;
	Link newnode = NULL;
	int i;

	create_link(&head);
	for(i = 0;i < 10;i++)
	{
		create_newnode(&newnode);
//		newnode->num = i;
        scanf("%d",&newnode->num);
		insert_newnode_mid(&head,&newnode,newnode->num);
//		insert_newnode(&head,newnode);
	}
	display(head);
	freelink(&head);
//   reverslink(&head);
	display(head);

    return 0;
}
</span>