[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fEH9v7CCGAv251XAUmTtxFgJXb0hxeDfVB1o933SZceE":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2024-03-26 20:07:10",135430530,[8,9,10,11],"逻辑特性","元素类型","物理特性","运算方法",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},7,"0075e6f2a835f594c3389f1917136fad","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2fc6fa80336e65fc05dca56eb64fb1a6.jpg","数据结构A-1","work_33549289","第三章知识点回顾","栈和队列的共同之处在于它们具有相同的",[21,33,42,45,54,63,73],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2024-03-27 13:45:03",135430524,[26,27,28,29],"与元素的值的大小有关","与作为顺序存储结构的数组的大小有关","与队头指针和队尾指针的取值有关","由元素进入队列的先后顺序决定","若队列采用顺序存储结构,元素的排列顺序( )","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],135430527,[37,38,39,40],"top++","不变","--top","top=0","若栈采用顺序存储结构,正常情况下,往堆栈中插入一个元素,栈顶指针top的变化是",{"answer":43,"createTime":5,"id":6,"options":44,"question":19,"source":31,"type":32},[],[8,9,10,11],{"answer":46,"createTime":5,"id":47,"options":48,"question":53,"source":31,"type":32},[],135430532,[49,50,51,52],"它们具有一般线性表所没有的逻辑特性","它们的存储结构比较特殊","对它们的使用方法做了限制","它们比一般线性表更简单","栈和队列都是特殊的线性表,其特殊性在于",{"answer":55,"createTime":23,"id":56,"options":57,"question":62,"source":31,"type":32},[],135430534,[58,59,60,61],"a,c,b,d","d,a,c,b","a,b,c,d","d,c,b,a","某队列初始为空,若它的输入序列为a,b,c,d,它的输出序列应为",{"answer":64,"createTime":65,"id":66,"options":67,"question":72,"source":31,"type":32},[],"2024-03-25 10:44:53",135430536,[68,69,70,71],"对数据进行的操作","数据的逻辑结构","链表的种类","数据的存储结构",""链接队列"这一概念不涉及( )",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":31,"type":32},[],135430538,[77,78,79,80],"2,3,1,5,4","3,1,2,5,4","2,4,3,1,5","3,1,4,2,5","若5个元素的出栈序列为1,2,3,4,5,则进栈序列可能是"]