完整地描述了数据结构中的进栈过程：在堆栈中，用户只能在指定的一端插入和删除元素，因此具有后进先出(LIFO)的特性；在队列中，用户只能在一端插入元素而在另一端删除元素，因此呈现先进先出(FIFO)的特性。从数据结构角度看，它们都是线性结构。

-A complete descr iption of the data structure into the stack process: in the stack, users can insert and delete elements at one end of a specified, it has LIFO (LIFO) characteristics　in the queue, the user can insert elements at one end At the other end of the deleted elements, presented first in first out (FIFO) characteristics. From the data structure point of view, they are linear structure.