第二章练习

20。用两个栈S1和S2模拟队列插入和删除

void insert(datatype x, sepstack* S1, sepstack* S2) {
    if (top2 == n)printf("queue full");
    top2++;
    if (top2 > 0)
        S2.data[top2] = x;
    else S1.data[top2] = x;
}
void delete(sepstack* S1, sepstack* S2) {
    if (top1 > top2)
        printf("queue empty");
    if (top1 < 1)
        x = S1.data[top1];
    else x = S2.data[top1];
    top1++;
    return x;
}