判断给定的字符串是否是回文数（用栈实现）

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXSIZE 20

struct SeqStack{
    char data[MAXSIZE];
    int top;
};

SeqStack * initSeqStack(){
    SeqStack * s;
    s = (SeqStack *)malloc(sizeof(SeqStack));
    s->top = -1;
    return s;
}

void pushSeqStack(SeqStack * s,char x){
    if(s->top == MAXSIZE-1){
        printf(<