[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fYHPDSj4e09QuzXsTbW5rX--PeMvM2rKTSK6Bg3fWBK4":3},{"id":4,"source":5,"question":6,"options":7,"answer":8,"related":9,"type":91,"origin":103,"createTime":92},180638168,"v1","当栈中元素为n个时(top=0表示栈空),进栈操作发生数据上溢,则说明栈的最大容量为_________",[],[],[10,23,34,44,54,65,75,85,93,97],{"id":11,"source":5,"question":12,"options":13,"answer":18,"related":19,"type":20,"origin":21,"createTime":22},180636705,"\u003Cimg src=\"https:\u002F\u002Fp.ananas.chaoxing.com\u002Fstar3\u002Forigin\u002Ff5cd0e28c5cf598a2f595cc7caf9f6e7.png\">",[14,15,16,17],"5,4,3,2,1","4,1,2,3,5","3,2,1,5,4","2,1,5,4,3",[],[],0,null,"2025-03-28T20:07:47+08:00",{"id":24,"source":5,"question":25,"options":26,"answer":31,"related":32,"type":20,"origin":21,"createTime":33},180636709,"一个栈的输入序列为123…n,若输出序列的第一个元素是n,输出第i(1\u003C=i\u003C=n)个元素是( )",[27,28,29,30],"不确定","n-i+1","i","n-i",[],[],"2025-03-28T20:07:48+08:00",{"id":35,"source":5,"question":36,"options":37,"answer":42,"related":43,"type":20,"origin":21,"createTime":33},180636718,"设有5个元素的进展序列为a,b,c,d,e,其输出序列是c,e,d,b,a,则该栈的容量至少是( )",[38,39,40,41],"1","2","3","4",[],[],{"id":45,"source":5,"question":46,"options":47,"answer":52,"related":53,"type":20,"origin":21,"createTime":33},180636724,"若进展序列为A,B,C,则通过进栈、出栈运算后可能得到A,B,C的不同的出栈序列个数为",[48,49,50,51],"7","6","8","5",[],[],{"id":55,"source":5,"question":56,"options":57,"answer":62,"related":63,"type":20,"origin":21,"createTime":64},180636729,"向一个不带头结点的栈顶指针为lst的链栈中插入一个*s结点时,则执行( )",[58,59,60,61],"lst->next=s","s->next=lst->next; lst->next=s","s->next=lst; lst=s","s->next=lst; lst=lst->next",[],[],"2025-03-28T20:07:49+08:00",{"id":66,"source":5,"question":67,"options":68,"answer":73,"related":74,"type":20,"origin":21,"createTime":64},180636734,"中缀表达式 A+B*(C-D) 转换为后缀表达式,正确的是",[69,70,71,72],"ABCD-*+","AB+CD-*","ABCD*-+","AB*CD-+",[],[],{"id":76,"source":5,"question":77,"options":78,"answer":83,"related":84,"type":20,"origin":21,"createTime":64},180636739,"链栈相比于顺序栈的主要优点是()",[79,80,81,82],"存取速度更快","无需预分配固定空间","内存连续利用率高","支持随机访问",[],[],{"id":86,"source":5,"question":87,"options":88,"answer":89,"related":90,"type":91,"origin":21,"createTime":92},180638167,"在有n个元素的栈中,进栈操作的时间复杂度为_________; 出栈操作的时间复杂度为________",[],[],[],2,"2025-03-28T20:20:00+08:00",{"id":4,"source":5,"question":6,"options":94,"answer":95,"related":96,"type":91,"origin":21,"createTime":92},[],[],[],{"id":98,"source":5,"question":99,"options":100,"answer":101,"related":102,"type":91,"origin":21,"createTime":92},180638169,"4个元素按A,B,C,D顺序进栈S,执行两次Pop(S,x)运算后,x值为_______",[],[],[],{"courseName":104,"courseImg":105,"workName":106,"workId":107,"count":108,"courseId":109},"数据结构","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","第三章 栈 练习题","work_42208377",19,"1e20f3e464666c92dc37d29542751b13"]