（1）采用链式存储实现栈的初始化、入栈、出栈操作。

（2）采用顺序存储实现栈的初始化、入栈、出栈操作。

（3）采用链式存储实现队列的初始化、入队、出队操作。

（4）采用顺序存储实现循环队列的初始化、入队、出队操作。

（5）在主函数中设计一个简单的菜单，分别测试上述算法。

（6）综合训练:1)利用栈实现表达式求值算法。

2)利用栈实现迷宫求解。

-(1) the use of chain-store to achieve stack initialization,入栈, a stack operation. (2) the realization of the order of the storage stack initialization,入栈, a stack operation. (3) the realization of chain store queue initialization, entry team, a team operation. (4) the order of storage used to achieve the cycle queue initialization, entry team, a team operation. (5) in the main function in the design of a simple menu, respectively, to test the above algorithm. (6) comprehensive training: 1) the use of stacks to achieve expression evaluation algorithm. 2) the realization of the use of stacks to solve the maze.