栈是限制仅在表的一端插入和删除的线性表，是生活中某些过程的抽象。插入和删除操作的一端称为栈顶，插入操作称作入栈（Push），删除操作称作出栈（Pop）。栈顶元素总是最后进栈的，和最先出栈的；而栈底元素是最先进栈，最后出栈。栈具有后进先出（LIFO）的特性。顺序栈是栈的顺序存储结构的实现。链栈是栈的链式存储结构的实现。-Stack is limited only to one end of the table insert and remove a linear form, is the life of some process of abstraction. The end of the insert and delete operations as stack, called stack insertion operations (Push), to delete said stack (Pop). The top element into the stack is always the last, and the first out stack　the bottom of the stack is the most advanced elements of the stack, the final stack. Stack with LIFO (LIFO) features. Sequential order of the stack is the stack storage structure implementation. Chain store chain stack is a stack structure implementation.