都可以用数组来模拟,复习一下:
栈:
int stack[Max],top=-1;
stack[++top]=num;//push
num=stack[top--];//pop
队列:
int queue[Size];
int front=0,rear=0;
queue[rear++]=num;//enqueue
num=queue[front++];//dequeue
if(rear==Size)
printf("the queue is full\n");
if(front==rear)
printf("the queue is empty\n");