栈&&队列判断回文

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

#define MAXSIZE 10000
typedef struct{
    char data[MAXSIZE];
    int top;

}SqStack;
typedef SqStack *Stack;
typedef struct{
    char data[MAXSIZE];
    int front;
    int rear;

}Queue;
typedef Queue* queue;
char PopQueue(Queue *q);
bool PushQueue(Queue *q,char c);
bool PushStack(SqStack *s,char c);
bool StatckEmpty(SqStack *s);
char PopStack(SqStack *s);
int main() {
   // char string[MAXSIZE];
    Stack s= (Stack)malloc(sizeof(SqStack));
    s->top=-1;
    queue q=(queue)malloc(sizeof(Queue));
    q->front=q->rear=0;
    bool flag=true;
   // gets(string);
    char p;
    while ((p=getchar())!='?'){
        PushQueue(q,p);
        PushStack(s,p);
    }
    while(!StatckEmpty(s)){
        if(PopQueue(q)!=PopStack(s)){
            flag=false;
            printf("NO");
            break;
        }


    }
    if(flag){
        printf("Yes");
    }

   // printf("Hello, World!
");
    return 0;
}

bool StatckEmpty(SqStack *s){
    return s->top==-1;
}
bool PushStack(SqStack *s,char c){
    if(s->top==MAXSIZE-1){
        return false;
    }
    s->top++;
    s->data[s->top]=c;
    return true;
}
char PopStack(SqStack *s){
    if(s->top==-1){
        return '0';
    }
    return s->data[s->top--];
}
bool PushQueue(Queue *q,char c){
    if((q->rear+1)%MAXSIZE==q->front){
        return false;
    }
    q->rear=(q->rear+1)%MAXSIZE;
    q->data[q->rear]=c;
    return  true;
}
char PopQueue(Queue *q)
{
    if(q->rear==q->front){
        return '0';
    }
    q->front=(q->front+1)%MAXSIZE;
    char f=q->data[q->front];
    return f;
}

思路：队列先进先出，栈后进后出，读入字符串分别入栈入队，再分别出栈出队，当任一次不匹配则字符串不是回文