c语言链表操作

#include <stdio.h>
#include <STDLIB.H>

typedef struct NODE
{
	int num;
	struct NODE * next;
}Node;

void showList(Node * head)
{
	while(head)
	{
		printf("%d ",head ->num);
		head = head ->next;
	}
	printf("\n");
}


void insertList(Node ** head,int data)
{
	Node * pre,*cur;
	cur = *head;
	pre = NULL;
	while(cur && cur ->num < data)
	{
		pre = cur;
		cur = cur ->next;
	}
	Node * pnew = (Node *)malloc(sizeof(Node));
	pnew ->num = data;

	pnew ->next = cur;
	if(pre == NULL)
		*head = pnew;
	else
		pre ->next = pnew;
	
}

void reverse(Node ** head)
{
	Node * current =* head;
	Node * next = NULL,*result = NULL;
	while(current != NULL)
	{
		next = current ->next;
		current ->next = result;
		result = current;
		current = next;
	}	
	(*head) = result;
}

void deleteList(Node ** head,int num)
{
	Node * cur = *