为什么单链表没有逆转成功啊

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

typedef int ElemType;
typedef struct LNode
{
ElemType data;
LNode *next;
}LNode,*LinkList;

void CreateList(LinkList &L,int n)
{
LNode *r,*p;
L = new LNode;
L->next = NULL;
r = L;
for(int i=0;i<n;i++)
{
p = new LNode;
scanf("%d",&p->data);
p->next = NULL;
r->next = p;
r = p;
}
}

void CreateList_1(LinkList &L){
LinkList t;
ElemType data;
printf("");
while (1){
if (scanf("%d",&data) == 1){
t = new LNode;
t->data = data;
t->next = L->next;
L->next = t;
}
if ((getchar()) == '\n') break;
}
}

void Inverse(LinkList &L)
{
LinkList p,q;
p = L->next;
L->next = NULL;
while(p != NULL)
{
q = p->next;
p->next = L->next;
L->next = p;
p = q;
}
}

int main()
{
int n;
LinkList L,L1;
CreateList(L1,n);
printf("逆转后的单链表为：\n" );
Inverse(L);
CreateList_1(L);
return 0;
}

修改处见注释，供参考：

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

typedef int ElemType;
typedef struct LNode
{
    ElemType data;
    LNode*   next;
}LNode, * LinkList;

void CreateList(LinkList& L, int n)
{
    LNode* r, * p;
    L = new LNode;
    L->next = NULL;
    r = L;
    for (int i = 0; i < n; i++)
    {
        p = new LNode;
        scanf("%d", &p->data);
        p->next = NULL;
        r->next = p;
        r = p;
    }
}

void CreateList_1(LinkList& L) {
    LinkList t;
    ElemType data;
    printf("");
    while (1) {
        if (scanf("%d", &data) == 1) {
            t = new LNode;
            t->data = data;
            t->next = L->next;
            L->next = t;
        }
        if ((getchar()) == '\n') break;
    }
}

void Inverse(LinkList& L)
{
    LinkList p, q;
    p = L->next;
    L->next = NULL;
    while (p != NULL)
    {
        q = p;           //q = p->next;
        p = p->next;    //修改
        q->next = L->next; //p->next = L->next;
        L->next = q;  //L->next = p;
                      //p = q;
    }
}
void showList(LinkList L)  //修改
{
    LinkList p = L;
    while (p->next) {
        printf("%d ", p->next->data);
        p = p->next;
    }
    printf("\n");
}

int main()
{
    int n;
    LinkList L, L1;
    printf("请输入链表的长度:"); //修改
    scanf("%d", &n);             //修改
    CreateList(L1, n);
    showList(L1);               //修改

    printf("逆转后的单链表为：\n");
    Inverse(L1);     //Inverse(L); 修改
    showList(L1);    //修改

    //CreateList_1(L);  修改
    return 0;
}