用模板实现顺序栈的基本功能：初始化；判断栈空；判断栈满；置空栈；入栈；出栈；要求入栈时，栈非满是可以插入元素，否则抛除异常；出栈时，栈非空返回栈顶元素，否则抛除异常。(陈儒焕组)

5、队列是只允许在一端进行插入操作，而另一端进行删除操作的线性表。如何改造数组实现队列的顺序存储。要求：用模板实现队列的判空；判满；置队空；出队，队列非空时，出队队首元素，否则报错；出队，队列非满时，插入新元素到队尾，否则报错；

-The template is the order of the stack to achieve the basic functions: initialization　to determine the stack empty　to determine the stack full　home empty stack　stack　out of the stack　request stack, the stack can be inserted elements of non-full, otherwise, except throwing an exception　out of stack, the stack is non-empty return stack element, or else except throwing an exception. (Ru-hwan group) 5, the queue is only allowed at one end of insertion, while the other end of the deletion operation of a linear form. How to transform an array to achieve the order of the queue storage. Requirements: use templates to achieve the sub-queue empty　sub-full　home team empty　a team, the queue of non-empty out teams of the first element, otherwise Baocuo　a team, the queue of non-full, insert a new element to the tail, Otherwise, Baocuo