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