栈,队列的基本操作以及十进制转任意进制.docxVIP

#includestdio.h#includestdlib.h#define N 100//栈的结构定义typedef struct{int elem[N];int top;//栈顶}Stack;//循环队列的结构定义typedef struct{int elem[N];int front;int rear;}Queue;int Greatstack(Stack*);int GreatQueue(Queue *);int Pop(Stack *);int Push(Stack *);int Allpush(Stack *);int EnQueue(Queue *);int DeQueue(Queue *);int AllQueue(Queue *);int Exchange(Stack *);void main(){char exit=N;int ch;int result,data;Stack s;Queue q;s.top=0;//栈顶指向当前栈顶的下一位置q.front=q.rear=0;do{system(CLS);printf(\t\t********************************************\n);printf(\t\t* 1.创建一个顺序栈 .................(1) *\n);printf(\t\t* 2.出栈..