|<center><img src=https://img-blogimg2.csdnimgbaidu.cncom/it/20200927094758190.png#pic_center u=3892814575,2168005903&fm=253&fmt=auto&app=138&f=PNG?w=842&h=500 width="300"></center><small>[https://image.baidu.com/search/detail?ct=503316480&z=0&ipn=d&word=Stack(%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%A7%91%E5%AD%A6%E4%B8%AD%E6%98%AF%E4%B8%80%E7%A7%8D%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84)&step_word=&hs=0&pn=49&spn=0&di=71890649088629145617207123747461922817&pi=0&rn=1&tn=baiduimagedetail&is=0%2C0&istype=20&ie=utf-8&oe=utf-8&in=&cl=2&lm=-1&st=-1undefined&cs=4209997777544140307%2C34127242172C3298739912&os=1708121147498189404%2C21046310332C1658537443&simid=3050070293544140307%2C38035636262C3298739912&adpicid=0&lpn=0&ln=1595&fr=&fmq=1680250029043_R1680250111126_R&fm=&ic=undefined&s=undefined&hd=undefined&latest=undefined&copyright=undefined&se=&sme=&tab=0&width=undefined&height=undefined&face=undefined&ist=&jit=&cg=&bdtype=015&oriquery=&objurl=https%3A%2F%2Fimg-blog2Fimg2020.csdnimgcnblogs.cncom%2F202009270947581902Fblog%2F1821919%2F202101%2F1821919-20210130232441463-448498142.png%23pic_center&fromurl=ippr_z2C%24qAzdH3FAzdH3Fks52_z24qAzdH3FAzdH3Fp_z%26e3Bvf1g_z26e3Bz57hwghwg_z%26e3Bv54AzdH3Fg5eotg1-r-89nc8adl_z%26e3BgjpAzdH3Fqq_9908n9c9AzdH3Fw6ptvsjAzdH3F1jpwtsfAzdH3F8abbn88ac26e3Bip4s&gsm=1e&rpstart=0&rpnum=0&islist=&querylist=&nojc=undefined&dyTabStr=MCwzLDIsNiw1LDQsMSw4LDcsOQMCw0LDEsNSw2LDMsNyw4LDIsOQ%3D%3D 来自网络的图片]</small>

用桶堆积物品，先堆进来的压在底下，随后一件一件往上堆。取走时，只能从上面一件一件取。读和取都在顶部进行，底部一般是不动的。栈就是一种类似桶堆积物品的数据 [[ 结构 ]] ，进行删除和插入的一端称栈顶，另一端称栈底。插入一般称为进栈，删除则称为退栈。 栈也称为后进先出表。