栈(Stack) 和 队列(Queue)总结

In a LIFO data structure, the newest element added to the queue will be processed first.

Different from the queue, the stack is a LIFO data structure. Typically, the insert operation is called push in a stack. Similar to the queue, a new element is always added at the end of the stack. However, the delete operation, pop, will always remove the last element which is opposite from the queue.

标签：queue,operation,队列,element,Queue,will,stack,data,Stack
来源： https://www.cnblogs.com/hackerk/p/16365175.html