结构定义错了，
typedef struct
{  int data[Maxsize];
   int *rear;//LqueueNode *rear,*front;
   int *front;
}LinkQueue;

#include<stdio.h>
#include<stdlib.h>
#define Maxsize 20
typedef struct LQNode
{int data;
 struct LQNode *next;
 }LqueueNode;
typedef struct
{  int data[Maxsize];
   int *rear;
   int *front;
}LinkQueue;
int  EnLQueue(LinkQueue *Q,int x)
{LqueueNode *p;
if((p=(LqueueNode*)malloc(sizeof(LqueueNode)))==NULL) return 0;
p->data=x;p->next=NULL;
if(Q->rear!=NULL)  Q->rear->next=p;
Q->rear=p;
if(Q->front==NULL) Q->front=p;
return  1;
}

int DeLQueue(LinkQueue *Q,int *x)
{LqueueNode   *p;
if (Q->front==NULL)
   {printf("\nError:the queue is empty!\n");
   return 0;
   }
   *x=Q->front->data;
   p=Q->front;
   Q->front=Q->front->next;
   if(Q->front==NULL)   Q->rear=NULL;
   free(p);
   return  1;
   }
   main()
   {char ch;
   int x;
   LinkQueue *Q;
   int EnQueue(LinkQueue *Q,int x);
   int DeLQueue(LinkQueue *Q,int *x);
   printf("\nqing shu ru cha ru wei zhi :\n");
   scanf("%d" ,&x);
   EnLQueue(Q,x);
   printf("\nDO YOU WANT TO CONTINUE(Y/N)?");
   getchar();
   ch=getchar();
   printf("\nDO YOU WANT TO DELETE THE DATA FROM QUEUE(Y/N)?");
   getchar();
   ch=getchar();
   while(ch=='Y')
      { DeLQueue(Q,&x);
 printf("\nTHE DATA DELETED FROM QUEUE IS :%d",x);
 printf("\nDO YOU WANT TO CONTNUE (Y/N)?");
 getchar();
 ch=getchar();
 }
 }

18:    pointer  required on left side of -> in fuction ENLQueue;
19:   suspicious pointer coversion in fuction ENLQueue;
20:   suspicious pointer coversion in fuction ENLQueue;
31:   pointer  required on left side of -> in fuction DELQueue;
32:  suspicious pointer coversion in fuction  DELQueue;
33:  pointer  required on left side of -> in fuction DELQueue;
37:parameters 'x' is never used  in fuction DELQueue;
46:possible  used of  'Q' before definition in fuction main;
54:possible  used of  'Q' before definition in fuction main;
怎么修改啊?帮心忙改一下吧,谢了

#define QUEUE_BUFFER_LENGTH   100
typedef struct tagEEPROM_QUEUE
{
    ELEMENT element[QUEUE_BUFFER_LENGTH];
    unsigned char rear;
    unsigned char front;
}EEPROM_QUEUE;
EEPROM_QUEUE QUEUE;
void QUEUE_Init(void)
{
    QUEUE.rear = 0;
    QUEUE.front = 0;
}


BOOL QUEUE_EMPTY(void)
{
    if (QUEUE.rear == QUEUE.front)
        return (TRUE);
    return (FALSE);
}


BOOL QUEUE_FULL(void)
{
    if ((QUEUE.rear+1) % QUEUE_BUFFER_LENGTH == QUEUE.front)
        return (TRUE);
    return (FALSE);
}


BOOL QUEUE_ADD(ELEMENT element)
{
if (!QUEUE_FULL())
{
    QUEUE.rear = (QUEUE.rear + 1) % QUEUE_BUFFER_LENGTH;
        QUEUE.element[QUEUE.rear].bVal = element.bVal;
        QUEUE.element[QUEUE.rear].Addr = element.Addr;
        return (TRUE);
    }
    return (FALSE);
}


BOOL QUEUE_DELETE(ELEMENT_PTR element)
{
    if (!QUEUE_EMPTY())
    {
        QUEUE.front = (QUEUE.front + 1) % QUEUE_BUFFER_LENGTH;
        element->bVal = QUEUE.element[QUEUE.front].bVal;
        element->Addr = QUEUE.element[QUEUE.front].Addr;
        return (TRUE);
    }
    return (FALSE);
}

typedef struct tagELEMENT
{
    unsigned char bVal;
    unsigned int Addr;
}ELEMENT

楼上用得是循环队列。
楼主主要的错误类型没定义好，像Q->rear=p;
左边Q->rear的数据类型是int *，而p的类型是struct  LQNode *，里面还有好多类似的错误，建议楼主自己好好看一下

我的题类型定义错了不知如何改啊.大家帮忙改一下吧.谢谢了!

//单链队列--------队列的链式存储表示
typedef struct QNode{
  QElemType data;
  struct QNode *next;
}QNode,*Qptr;
typedef struct{
  Qptr front; //队列首指针
  Qptr tail;//队列尾指针
}LinkQueue;

//队列的顺序表示----定长数组
typedef struct{
QElemType data[Maxsize];
int front;//队列首指针
int rear;//队列尾指针
}SQueue;