The meaning of "last in first out" in stack and "first in first out" in queue

从定义来说,

栈

限定仅在表尾进行插入或删除操作的线性表.That is to say it has two operations,And the operands are all at the end of the linear list

队列

是一种特殊的线性表,它只允许在表的前端（front）进行删除操作,而在表的后端（rear）进行插入操作.

This means that the objects of its insertion and deletion operations are different

Operands of these two basic operations(参数)The difference constitutes the effect of FIFO and LIFO.

For example also in the linear table “按顺序” 插入1,2,3,4

对于栈,Only trailing deletions are allowed,So the one that pops first will be4,即后进先出
形象点说,栈只有一个开口,The first to go is the bottom,The last one is in the front,要是拿出去的话,肯定是从开口端拿出去,所以说先进后出,后进先出.

对于队列,Only allowed to delete in the head,So the first to go is1,即先进先出

https://blog.csdn.net/yang_study_first/article/details/103933409?ops_request_misc=&request_id=&biz_id=102&utm_term=%E6%A0%88%20%E9%98%9F%E5%88%97&utm_medium=distribute.pc_search_result.none-task-blog-2_allsobaiduweb~default-2-103933409.first_rank_v2_pc_rank_v29&spm=1018.2226.3001.4187

https://blog.csdn.net/Marmara01/article/details/89014828?ops_request_misc=&request_id=&biz_id=102&utm_term=%E6%A0%88%20%E9%98%9F%E5%88%97&utm_medium=distribute.pc_search_result.none-task-blog-2_allsobaiduweb~default-0-89014828.first_rank_v2_pc_rank_v29&spm=1018.2226.3001.4187