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