帮小弟我改一下程序呀！请高手呀！

帮我改一下程序呀！！请高手呀！！！
#include <stdio.h>

#define   maxsize   5
typedef   int   datatype;
typedef   struct{
datatype   a[maxsize];
int   front;
int   rear;
}seqqueue;
void   initsequeue(seqqueue   *p);
int   isemptysequeue(seqqueue   *p);
int   getfirstseqqueue(seqqueue   *p);
void   outoutseqqueue(seqqueue   *p);
void   inserseqqueue(seqqueue   *p,int   x);
void   delseqqueue(seqqueue   *p);

void   initseqqueue(seqqueue   *p)
{   p-> front=p-> rear;
}

int   isemptyseqqueue(seqqueue   *p)
{return(p-> front==p-> rear?1:0);


}


int   getfirstsuqqueue(seqqueue   *p)
{   if(isemptyseqqueue(p))
        printf( "the   sequeue   is   empty\n ");
    return   p-> a[p-> front];
}

void   outputseqqueue(seqqueue   *p)
{   int   i;
  if(isemptyseqqueue(p))
    printf( "the   sequeue   is   empty\n ");
  for(i=p-> front;i <p-> rear;i++)
    printf( "%5d ",p-> a[i]);
}
void   inserseqqueue(seqqueue   *p,int   x)
{int   i;
  if(p-> rear==maxsize){printf( "the   seqqueue   is   full\n ");}
  p-> a[p-> rear]=x;
  p-> rear++;
}
void   delseqqueue(seqqueue   *p)
{if(isemptyseqqueue(p)){printf( "the   sequeue   is   empty\n ");
    }
  p-> front++;
}
main()
{struct   seqqueue   *p;
  int   a[5]={1,2,3,4,5};

  int   empty=isemptyseqqueue(p);
  int   output=outputseqqueue(p);
  int   getfirst=getfirstseqqueue(p);

  inserseqqueue(p,3);
  outputseqqueue(p);

  delseqqueue(p);
  outputseqqueue(p);


}

[解决办法]
#include <stdio.h>

#define maxsize 5
typedef int datatype;
typedef struct{
datatype a[maxsize];
int front;
int rear;
}seqqueue;
void initsequeue(seqqueue *p);
int isemptysequeue(seqqueue *p);
int getfirstseqqueue(seqqueue *p);
void outoutseqqueue(seqqueue *p);
void inserseqqueue(seqqueue *p,int x);
void delseqqueue(seqqueue *p);

void initseqqueue(seqqueue *p)
{ p-> front=p-> rear;
}

int isemptyseqqueue(seqqueue *p)
{return(p-> front==p-> rear?1:0);


}


int getfirstsuqqueue(seqqueue *p)
{ if(isemptyseqqueue(p))
printf( "the sequeue is empty\n ");
return p-> a[p-> front];
}

void outputseqqueue(seqqueue *p)
{ int i;
if(isemptyseqqueue(p))
printf( "the sequeue is empty\n ");
for(i=p-> front;i <p-> rear;i++)
printf( "%5d ",p-> a[i]);
}
void inserseqqueue(seqqueue *p,int x)
{int i;
if(p-> rear==maxsize){printf( "the seqqueue is full\n ");}
p-> a[p-> rear]=x;
p-> rear++;
}
void delseqqueue(seqqueue *p)
{if(isemptyseqqueue(p)){printf( "the sequeue is empty\n ");
}
p-> front++;
}
main()
{seqqueue *p;
int a[5]={1,2,3,4,5};

int empty=isemptyseqqueue(p);

outputseqqueue(p);
int getfirst=getfirstseqqueue(p);

inserseqqueue(p,3);
outputseqqueue(p);

delseqqueue(p);
outputseqqueue(p);

}