懂C的高手请看

这是我编的一个程序，输入ABCDEF，输出ABCFED，找不到错误了，请高手帮忙#include<stdio.h>#include<stdlib.h>#define MaxSize 100typedef int ElemType;typedef struct{ElemType stack[MaxSize];int top;}SeqStack;void InitStack(SeqStack *s){s->top=-1;}int StackEmpty(SeqStack *s){return s->top==1;}void push(SeqStack *s, ElemType x){if(s->top==MaxSize-1){ printf("\n stack overflow! ");exit(1);}++s->top;s->stack[s->top]=x;}int pop(SeqStack *s){if(StackEmpty(s)){printf("\n stack underfloe !");exit(1);}return s->stack[s->top--];}typedef struct{int data[MaxSize];int front;int rear;}queue;void InitQueue(queue *q){ q->front=q->rear=0;}void EnQueue(queue *q,int x){if((q->rear+1)%MaxSize==q->front){printf("\n overflow!");exit(1);}q->data[q->rear]=x;q->rear=(q->rear+1) % MaxSize;}int QueueEmpty(queue *q){if(q->rear==q->front) return 1;else return 0;} int DeQueue(queue *q) { int x;if(QueueEmpty (q)) { printf("\n underflow !");exit(1);} x=q->data[q->front];q->front=(q->front+1)%MaxSize;return x;} fun(int n) {int m,x;SeqStack *s;queue q;if(n<=67) { EnQueue(&q,n);while(!QueueEmpty(&q)) { m=DeQueue(&q);printf("%c",m);} if(n>67) InitStack(s);push(s ,n);printf("\n");while(!StackEmpty(s)) {x=pop(s);printf("%c",x);} } void main(){ int i,n;char a[6];printf("Enter\n ");for(i=0;i<=5;i++) scanf("%c",&a[i]);for(i=0;i<=5;i++) { n=a[i];fun(n);} } 收起