带表头的循环链表

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


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


struct node
{
int num;
struct node * next;
};


typedef struct node Node;
typedef struct node * Link;


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


void create_newnode(Link * new_node)
{
*new_node = (Link) malloc(sizeof(Node));
is_malloc_ok(*new_node);
}


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


void insert_node_head(Link * head,Link new_node)
{
(new_node)->next = (*head)->next;
(*head)->next = new_node;
}


void display_node(Link  head)
{
Link tmp;
tmp = head->next;


if((head)->next == head)
{
printf("The link is empty!\n");
}
while(tmp != head)
{
printf("num = %d\n",tmp->num);
tmp = tmp->next;
}
}




void insert_node_tail(Link *head,Link new_node)
{
    Link tmp;


tmp = *head;

while(tmp->next != *head)
{
tmp = tmp->next;
}
tmp->next = new_node;
new_node->next = *head;
}


void insert_node_mid(Link *head,Link *new_node,int num)
{
Link p1 = NULL;
Link p2 = NULL;


p1 = *head;


while(p1->num < num && p1->next != NULL)
{
p2 = p1;
p1 = p1->next;
}
if((*head)->next == NULL)
{
if(num < p1->num)
{
(*new_node)->next = *head;
*head = *new_node;
}
else
{
(*head)->next = *new_node;
(*new_node)->next = NULL;
}
}
else
{
if(p1 == *head)
{
(*new_node)->next = *head;
*head = *new_node;
}
else
{
if(p1->next == NULL)
{
  if(num  < p1->num)
{
    p2->next = *new_node;
(*new_node)->next = p1;
}
else
{
  p1->next = *new_node;
(*new_node)->next = NULL;
}
}
else
{
  p2->next = *new_node;
(*new_node)->next = p1;
}

}
}
}


/*void insert_node_mid(Link *head,Link new_node,int num)
{
    Link tmp;
tmp = *head;


while(tmp->num != num && tmp->next != *head)
{
        tmp = tmp->next;
}
    if(tmp->num == num)
{
new_node->next = tmp->next;
tmp->next = new_node;
}
else
{
printf("no such node!\n");
}
}


}*/


void reverse_node(Link *head)
{
Link p3 = *head;
Link p2 = p3->next;
Link p1 = p2->next;


if(NULL == *head)
{
printf("The link is empty!");
return;
}


if((*head)->next == NULL)
{
return;
}


if(p2->next == NULL)
{
*head = p2;
p2->next = p3;
p3->next = NULL;
}
else
{
p3->next = NULL;
while(p1->next != NULL)
{
p2->next = p3;
p3 = p2;
p2 = p1;
p1 = p1->next;
}
p2->next = p3;
p1->next = p2;
*head = p1;
}


}
void delete_node(Link *head,int num)
{
Link tmp;
Link p;
tmp = p = *head;


while(tmp->num != num && tmp->next != NULL)
{
p = tmp;
tmp = tmp->next;
}


if(tmp->num == num)
{
        if(tmp == *head)
{
            *head = tmp->next;
free(tmp);
}
else
{
p->next = tmp->next;
free(tmp);
}
}
else
{
printf("no such node!\n");
}
}


void release(Link *head)
{
Link p1 = (*head)->next;
while(p1 != *head)
{
(*head)->next = p1->next; 
free(p1);
p1 = (*head)->next;
}
}


int main()
{
    Link head = NULL;
    Link new_node = NULL;
    int i;
int num;


create_link(&head);


    for(i = 0; i < 10;i++)
{
        create_newnode(&new_node);
// scanf("%d",&(new_node->num));
// insert_node_mid(&head,&new_node,new_node->num);
    new_node->num = i;
insert_node_head(&head,new_node);
// insert_node_tail(&head,new_node);
}






// insert_node_mid(&head,&new_node,num);


// printf("please input a num!\n");
// scanf("%d",&num);


// create_newnode(&new_node);
// new_node->num =  num;


// insert_node_mid(&head,new_node,10);
    
// delete_node(&head,num);


display_node(head);
// reverse_node(&head);


release(&head);
display_node(head);
//
    return 0;
}