单链表的递归逆置

#include <stdio.h>
#include <stdlib.h>
#define M 20
struct num
{
    int a;
    struct num *next;
};
struct num *reverse(struct num *head)
{
    struct num *p;
    p = head;
    if (p->next == NULL)
    {
        return p;
    }
    else
    {
        reverse(p->next);
        p->next->next = p;
        if (p == head)
        {
            p->next = NULL;
        }
    }
} 
struct num *creat(int n)
{
    struct num *phead, *ptail, *pnew;
    pnew = (struct num *)malloc(sizeof(struct num));
    scanf(