C语言链表逆序

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

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

typedef struct node Node;
typedef Node * Link;

enum result_val{RET_OK = 1000,RET_NO};

void create_head(Link * head)
{
    *head = NULL;
}

int is_malloc_ok(Link new_code)
{
    if(new_code == NULL)
    {
        return RET_NO;
    }
    else
    {
        return RET_OK;
    }
}

int create_code(Link * new_code)
{
    *new_code = (Link)malloc(sizeof(Node));
    if(RET_NO == is_malloc_ok(*new_code))
    {
        return RET_NO;
    }
    else 
    {
        return RET_OK;
    }
}

void insert_node_mind_sort(Link * head,Link new_node)
{
    Link p = NULL;
    Link q = NULL;
    p = q = *head;

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

        if(p == *head)
        {
            new_node->next = *head;
            *head = new_node;
        }
        else
        {
            q->next = new_node;
            new_node->next = p;
        }
        
    }
}
void display_link(Link head)
{
    Link p =NULL;
    p = head;
    if(p == NULL)
    {
        printf("\nthe link is empty !\n");
        return;
    }
    else
    {
        while(p != NULL)
        {
            printf("%d\t",p->num);
            p = p->next;
        }
    }
}

void release_node(Link * head)
{
    Link p = NULL;
    p = *head;
    while(*head != NULL)
    {
        p = *head;
        *head = (*head)->next;
        free(p);
    }
}
void reverse_node(Link * head)
{
    Link p1 = NULL;
    Link p2 = NULL;
    Link p3 =NULL;

    p1 = *head;
    if( *head == NULL)
    {
        printf("the link is empty !\n");
    }
    else if((*head)->next == NULL)
    {
        printf("No reverse order is required\n");
    }
    else if(((*head)->next)->next == NULL)
    {
        p2 = p1->next;

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

        while(p3 != NULL)
        {
            p2->next = p1;
            p1 = p2;
            p2 = p3;
            p3 = p3->next;
        }

        p2->next = p1;
        (*head)->next = NULL;
        *head = p2; 

    }

}

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

    srand((unsigned)time(NULL));
    create_head(&head);

    for(i = 0; i < 10; i++)
    {
        if(RET_OK == create_code(&new_node))
        {
            new_node->num = rand() % 100;
            insert_node_mind_sort(&head,new_node);
        }
        else
        {
            i--;
        }
    }
    
    display_link(head);
    reverse_node(&head);
    printf("\n");
    display_link(head);
    release_node(&head);
    display_link(head);
}