2.1栈的实现及应用

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

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

　　（3）设表达式以字符形式已存入数组E[n]中，‘#’为表达式的结束符，试写出判断表达式中括号‘（’、‘）’、‘[’、‘]’是否配对的C语言描述算法。

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

　　2.2 队列的实现

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

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

（3）在主函数中设计一个简单的菜单，-Implementation and Application 2.1 stack (1) the use of chain store to achieve stack initialization, stack, stack operation. (2) using sequential storage implementation initialize the stack, stack, stack operation. (3) Let expressions have been deposited in the form of a character array E [n], the ' #'　symbol for the end of the expression, the expression in parentheses trial judge to write ' (' , ' )' , ' [' , '　] ' is paired C language descr iption of the algorithm. (4) Design a simple menu in the main function, namely to test these algorithms. Achieve 2.2 queue (1) the use of chain store to achieve initialization of the queue, into the team, a team operation. (2) using sequential storage implementation initialization cycle queue, into the team, a team operation. (3) Design a simple menu in the main function,