using namespace std;
typedef struct linklist
{
int data;
struct linklist *pnext;
}list;
typedef struct
{
list *front;
list *rear;
}queue;
bool init(queue *L)
{
L=new queue;
L->front=new list;
L->rear=L->front;
L->front->pnext=NULL;
return true;
}
bool insert(queue *L,int x)
{
list *p;
p=new list;
p->data=x;
p->pnext=NULL;
L->rear->pnext=p;
L->rear=p;
return true;
}
int main()
{
queue *L;
int x=0;
init(L);
cin>>x;
insert(L,x);
}
如题,
![图片说明](https://img-ask.csdn.net/upload/202004/06/1586165437_59905.png)
insert里L->rear->pnext=p;显示program receiced signal SIGSEGV,Segmentation fault 求解