循环链表带表头结点

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

struct node
{
    int num;

    struct node * next;
};

typedef struct node Node;
typedef struct node * Link;

int is_malloc_ok(Link new_node)
{
    if(new_node == NULL)
    {
        printf("MALLOC ERROR!\n");

        return 0;
    }
    else
    {
        return 1;
    }
}

void create_node(Link * new_node)
{
    int count = 10;

    do 
    {
        *new_node = (Link)malloc(sizeof(Node));
        count--;
    }while(!is_malloc_ok(*new_node) && count);
}

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

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

void insert_node_tail(Link head,Link new_node)
{
    Link p;
    p = head;

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

void insert_node_mid_before(Link head,Link new_node,int loc)
{
    Link p,q;
    q = head;
    p = head->next;

    if(p == head)
    {
        head->next = new_node;
        new_node->next = head;
    }
    else
    {
        while(p->next != head && p->num != loc)
        {
            q = p;
            p = p->next;
        }
        if(p->next == head && p->num != loc)
        {
            p->next = new_node;
            new_node->next = head;
        }
        else
        {
            q->next = new_node;
            new_node->next = p;
        }
    }
}

void insert_node_mid_after(Link head,Link new_node,int loc)
{
    Link p;
    p = head->next;

    while(p != head && p->num != loc)
    {
        p = p->next;
    }
    if(p == head)
    {
        printf("NO SUCH NODE!\n");
    }
    else
    {
        new_node->next = p->next;
        p->next = new_node;
    }
}

void delete_node(Link head,int num)
{
    Link p = head;
    Link q;

    if(p->next == head)
    {
        printf("NO LINK!\n");
    }
    else
    {
        while(p->next != head && p->next->num != num)
        {
            p = p->next;
        }
        if(p->next == head && p->next->num != num)
        {
            printf("NO SUCH NODE!\n");
        }
        else
        {
            q = p->next;
            p->next = p->next->next;
            free(q);
        }
    }
}

void display(Link head)
{
    Link p;
    p = head;

    if(p == NULL)
    {
        printf("No Link!\n");
        return;
    }
    else if(p->next == NULL)
    {
        printf("Link is empty!\n");

    }
    else
    {
        while(p->next != head)
        {
            p = p->next;
            printf("num = %d\n",p->num);
        }
    }
}

void link_empty(Link head)
{
    Link p = head->next;

    if(p == head)
    {
        printf("no link!\n");
        return;
    }
    else
    {
        while((head->next) != head)
        {
            head->next = p->next;
            free(p);
            p = head->next;
        }
    }
}

void release_link(Link * head)
{
    Link p;
    p = (*head)->next;

    if(p == *head)
    {
        printf("Link is empty!\n");
        free(p);
        *head = NULL;
        return;
    }
    else
    {
        while(p != *head)
        {
            (*head)->next = p->next;
            free(p);
            p = (*head)->next;
        }
        free(*head);
        *head = NULL;
    }
}

int main()
{
    Link head;
    Link new_node;
    int i;
    int loc;
    int number;

    create_link(&head);

    for(i = 0;i < 5;i++)
    {
        create_node(&new_node);

        new_node->num = i + 1;

        //insert_node_head(head,new_node);
        insert_node_tail(head,new_node);
    }

    display(head);

    create_node(&new_node);

    printf("Input a number for new_node:\n");
    scanf("%d",&new_node->num);

    printf("Input a loc for new_node:\n");
    scanf("%d",&loc);

    //insert_node_mid_before(head,new_node,loc);
    insert_node_mid_after(head,new_node,loc);
    display(head);

    printf("Input a number you to be deleted:\n");
    scanf("%d",&number);

    delete_node(head,number);
    display(head);

    link_empty(head);
    display(head);

    release_link(&head);
    display(head);
    
    return 0;
}