[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fXRVMOvLasSp8kdjn63WgbhMKtSYAWz2voyyCD_xkq6U":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":18,"related":19,"source":29,"type":30},[],"2023-05-08 00:00:58",968048154,[8,9,10,11],"top不变","top=0","top=top+1","top=top-1",{"courseId":13,"courseImg":14,"courseName":15,"workId":16,"workName":17},"1000012555","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2afb429a18bfc644674488ce4ffdf35b.png","数据结构","55157778","数据结构教程考试","正常情况下,删除非空的顺序栈的栈顶元素,栈顶指针top的变化是( )",[20,31,40,49,57,66,69,78,87,96],{"answer":21,"createTime":5,"id":22,"options":23,"question":28,"source":29,"type":30},[],968048114,[24,25,26,27],"只有唯一的前驱","只有唯一的后继","有多个前驱","有多个后继","在线性表中,除了开始结点外,每个元素()","v2",0,{"answer":32,"createTime":5,"id":33,"options":34,"question":39,"source":29,"type":30},[],968048119,[35,36,37,38],"表的长度","元素的存放顺序","元素的类型","元素中各字段的类型","一个顺序表所占用的存储空间大小与()无关",{"answer":41,"createTime":5,"id":42,"options":43,"question":48,"source":29,"type":30},[],968048132,[44,45,46,47],"线性表在链式存储时,查找第i个元素的时间同i的值成正比","线性表在链式存储时,查找第i个元素的时间同i的值无关","线性表在顺序存储时,查找第i个元素的时间同i的值成正比","线性表在顺序存储时,查找第i个元素的时间同i的值有关","下面的叙述正确的是( )",{"answer":50,"createTime":5,"id":51,"options":52,"question":55,"source":29,"type":56},[],968048134,[53,54],"对","错","取线性表的第i个元素的时间同i的大小有关",3,{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":29,"type":30},[],968048153,[61,62,63,64],"top==0","top==-1","top==maxSize","top==maxSize-1","在顺序栈中,若栈顶指针top指向栈顶元素的下一个存储单元,且顺序栈的最大容量是maxSize,则顺序栈的判空条件是( )",{"answer":67,"createTime":5,"id":6,"options":68,"question":18,"source":29,"type":30},[],[8,9,10,11],{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":29,"type":30},[],968048180,[73,74,75,76],"0,0","0,n-1","n-1,0","n-1,n-1","已知循环队列存储在一维数组A[0...n]中,且队列非空时front和rear分别指向队首元素和队尾元素.若初始队列为空,且要求第一个进入队列的元素存储在A[0]处,则初始时front和rear的值分别是( )",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":29,"type":30},[],968048182,[82,83,84,85],"仅修改队头指针","仅修改队尾指针","队头、队尾指针都要修改","队头,队尾指针都可能要修改","用单链表存储队列时,其队头指针指向队头结点,其队尾指针指向队尾结点,则在进行删除操作时( )",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":29,"type":30},[],968048183,[91,92,93,94],"front=front.next","s.next=rearrear=s","rear.next=srear=s","s.next=frontfront=s","在一个非空的链队列中,front和rear分别为队头指针和队尾指针,则插入一个结点s的操作为( )",{"answer":97,"createTime":5,"id":98,"options":99,"question":100,"source":29,"type":56},[],968048190,[53,54],"对不含相同元素的同一输入序列进行两次不同的合法的入栈和出栈组合操作,所得的输出序列一定相同.( )"]