[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$frcKDzdTYFaDw_W8dUcbsNQLJKYp7TRiVK3q_zyV3e7k":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":28,"type":29},[],"2024-01-03 20:26:36",103318536,[8,9,10,11],"1","2","3","4",{"courseId":13,"courseImg":14,"courseName":15},"88d94d81dcc21ca1ce0c6100a1e4364b","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd695c0daa19fd55a18f0f44a273424d4.jpg","数据结构","若让元素1、2、3依次入队,则出队次序有( )种情况",[18,30,39,49,52,61,70,78,87,97],{"answer":19,"createTime":20,"id":21,"options":22,"question":27,"source":28,"type":29},[],"2024-01-04 11:57:23",103318531,[23,24,25,26],"abcde","decba","edcba","dceab","一个栈的入栈序列a,b,c,d,e,则栈的不可能的输出序列是( )","v1",0,{"answer":31,"createTime":20,"id":32,"options":33,"question":38,"source":28,"type":29},[],103318532,[34,35,36,37],"front = =0","rear+1 = = front","rear = = front+1","front= =rear","循环队列用数组A[n]存放其元素值,已知其头尾指针分别是front和rear,则判断队空的条件为( )",{"answer":40,"createTime":41,"id":42,"options":43,"question":48,"source":28,"type":29},[],"2024-01-03 20:26:35",103318534,[44,45,46,47],"rear-front","(rear-front+m)%m","rear-front-1","rear-front+1","循环队列用数组A[0,m-1]存放其元素值,已知其头尾指针分别是front和rear,则当前队列中的元素个数是( )",{"answer":50,"createTime":5,"id":6,"options":51,"question":16,"source":28,"type":29},[],[8,9,10,11],{"answer":53,"createTime":20,"id":54,"options":55,"question":60,"source":28,"type":29},[],103318538,[56,57,58,59],"都是先进后出","没有共同点","只允许在端点处插入和删除元素","都是先进先出","栈和队列的共同点是( )",{"answer":62,"createTime":20,"id":63,"options":64,"question":69,"source":28,"type":29},[],103318541,[65,66,67,68],"随意方式","链表存储结构和数组","线性存储结构和非线性存储结构","顺序存储结构和链式存储结构","栈结构通常采用的两种存储结构是( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":77,"source":28,"type":29},[],103318543,[74,37,75,76],"front!=(rear+1)%m0","front= =(rear+1)%m0","front!=rear","判定一个循环队列QU(最多元素为m0)为空的条件是( )",{"answer":79,"createTime":41,"id":80,"options":81,"question":86,"source":28,"type":29},[],103318545,[82,83,84,85],"索引存取的存储结构","顺序存取的存储结构","随机存取的存储结构","不一定","循环顺序队列是( )",{"answer":88,"createTime":89,"id":90,"options":91,"question":96,"source":28,"type":29},[],"2023-11-09 14:36:48",103318547,[92,93,94,95],"HS.next=s","next= HS;HS=s","next= HS.next;HS.next=s","next= HS; HS= HS.next","向一个栈顶指针为HS的链栈中( 不带空的头结点 )插入一个s所指结点时,则执行( )",{"answer":98,"createTime":99,"id":100,"options":101,"question":106,"source":28,"type":29},[],"2024-01-04 11:57:22",103318550,[102,103,104,105],"ST.top = = m0-1","ST.top = -1","ST.top = = -1","ST.top != -1ST.top = = -1","判定一个栈ST(最多元素为m0)为空的条件是( )"]