引发了未经处理的异常:读取访问权限冲突。 q 是 0xCCCCCCCC，求大佬解答

[The yong]

#include<stdio.h>
#include<stdlib.h>
typedef int Elemtype;
typedef struct link
{
int elem;
struct link* next;
}link;
link * initLink() {
link* p = (link*)malloc(sizeof(link));//创建一个头结点
link* temp = p;//声明一个指针指向头结点，用于遍历链表
//生成链表
for (int i = 1; i < 5; i++) {
link* a = (link*)malloc(sizeof(link));
a->elem = i;
a->next = NULL;
temp->next = a;
temp = temp->next;
}
return p;
}
void bianli(link* p)
{
link* q = p;
while (q->next)
{
q = q->next;
printf("%d",q->elem);
}
printf("\n");
}
int main()
{
link* p = initLink();
bianli(&p);
return 0;
}

为什么地址会出错啊，本人新手一枚检查不出来，求大佬解答

[The yong]

111求解啊

[qzjhjxj]

供参考：

#include<stdio.h>
#include<stdlib.h>
typedef int Elemtype;

typedef struct link
{
    int     elem;
    struct  link* next;
}link;

link * initLink()
{
    link* p = (link*)malloc(sizeof(link));//创建一个头结点
    link* temp = p;//声明一个指针指向头结点，用于遍历链表
     //生成链表
    for (int i = 1; i < 5; i++) {
         link* a = (link*)malloc(sizeof(link));
         a->elem = i;
         a->next = NULL;
         temp->next = a;
         temp = a; //  temp = temp->next;
    }
    return p;
}
void bianli(link* p)
{
    link* q = p;
    while (q->next)
    {
          q = q->next;
          printf("%d ",q->elem);
    }
    printf("\n");
}


int main()
{
    link* p = initLink();
    bianli(p);           //bianli(&p);
    
    return 0;
}

[源代码大师]

希望对你有帮助：https://blog.csdn.net/it_xiangqiang/category_10581430.html

[自信男孩]

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

typedef int Elemtype;
typedef struct link
{
    int elem;
    struct  link* next;
}link;

link * initLink()
{
    link *p = (link *)malloc(sizeof(link));//创建一个头结点
    if (!p)
        exit(0);
    link* temp = p;//声明一个指针指向头结点，用于遍历链表
    //生成链表
    for (int i = 1; i < 5; i++) {
        link* a = (link*)malloc(sizeof(link));
        if (!a)
            exit(0);
        a->elem = i;
        a->next = NULL;
        temp->next = a;
        temp = temp->next;
    }

    return p;
}
//void bianli(link* p)
void bianli(link* phead)
{
    if (!phead)
        return;
    //link* q = phead;
    link* q = phead->next;

    //while (q->next)
    while (q)
    {
        //q = q->next;
        printf("%d",q->elem);
        q = q->next;
    }
    printf("\n");
}

int main()
{
    link* p = initLink();
    //bianli(&p); //visit
    bianli(p); //visit

    return 0;
}

供参考～

参数类型不匹配，其他问题详见代码～