[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fITtJwgWltuNTXXW-BBZ4Qj6nr4ztGLyXk3ita7tD4sE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":17,"related":18,"source":29,"type":99},[],"2024-04-15 12:45:47",138429811,[8,9],"正确","错误",{"count":11,"courseId":12,"courseImg":13,"courseName":14,"workId":15,"workName":16},18,"d9139572bd8e9b466b5947011e5c5c3f","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9f919e91c3941b64f778d058a7fcb4c7.jpg","数据结构（C语言）","work_34129665","3.1 栈","栈底元素是不能删除的元素",[19,31,40,49,58,67,76,85,91,96],{"answer":20,"createTime":21,"id":22,"options":23,"question":28,"source":29,"type":30},[],"2024-04-09 22:56:06",137593516,[24,25,26,27],"5,4,3,2,1","2,1,5,4,3","4,3,1,2,5","2,3,5,4,1","若让元素1,2,3,4,5依次进栈,则出栈次序不可能出现在( )种情况","v1",0,{"answer":32,"createTime":21,"id":33,"options":34,"question":39,"source":29,"type":30},[],137593517,[35,36,37,38],"a","b","1","0","经过以下栈运算后,x的值是( ).InitStack(s); Push(s,a); Push(s,b); Pop(s,x); GetTop(s,x)",{"answer":41,"createTime":21,"id":42,"options":43,"question":48,"source":29,"type":30},[],137593518,[44,45,46,47],"push,pop,push,pop,push,pop","push,push,push,pop,pop,pop","push,push,pop,pop,push,pop","push,pop,push,push,pop,pop","已知一个栈的进栈序列是ABC,出栈序列为CBA,经过的栈操作是( )",{"answer":50,"createTime":21,"id":51,"options":52,"question":57,"source":29,"type":30},[],137593519,[53,54,55,56],"线性表","栈","队列","单链表","在数据处理过程中常需要保一些中间数据,如果后保存的数据先处理,则使用( )来保存这些数据",{"answer":59,"createTime":21,"id":60,"options":61,"question":66,"source":29,"type":30},[],137593520,[62,63,64,65],"st.top==st.base","st.top!=st.base","st.top-st.base>=MaxSize","以上都不对","判定一个顺序栈st为(元素个数最多为 MaxSize)空的条件为( )",{"answer":68,"createTime":21,"id":69,"options":70,"question":75,"source":29,"type":30},[],137593521,[71,72,73,74],"top++; data[top]=x","data[top]=x; top++","top--; data[top]=x","data[top]=x; top--","若一个栈用数组data[1..n]存储,初始栈顶指针top为n,则以下元素x进栈的正确操作是( )",{"answer":77,"createTime":21,"id":78,"options":79,"question":84,"source":29,"type":30},[],137593522,[80,81,82,83],"6","7","8","9","利用栈将十进制数 N(N<100)转换为二进制数时,为了确保栈在处理过程中不会发生上溢,则该栈至少要有( )个存储单元",{"answer":86,"createTime":5,"id":87,"options":88,"question":89,"source":29,"type":90},[],138429809,[],"栈是一种特殊的线性表,允许插入和删除运算的一端称为 ____ .不允许插入和删除运算的一端称为____",2,{"answer":92,"createTime":5,"id":93,"options":94,"question":95,"source":29,"type":90},[],138429810,[],"顺序栈用 data[0..n-1]存储数据,栈顶指为top,初始值为0,则元素x进栈的操作是____",{"answer":97,"createTime":5,"id":6,"options":98,"question":17,"source":29,"type":99},[],[8,9],3]