[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fWLTWSELvxTqKYlwgNDeGQfhpdou7u2-SEC4eg52QWJg":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-11-06 21:53:10",229923286,[8,9,10,11],"(n-1)\u002F2","n\u002F2","(n+1)\u002F2","n",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},115,"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","exam_167213194","第2章 线性表测试","从一个具有 n 个结点的单链表中查找其值等于 x 的结点时,在查找成功的情况下,需平均比较( )个元素结点",[21,32,41,50,55,63,72,75,84,89],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],229923280,[25,26,27,28],"head==NULL","head->next==NULL","head->next==head","head!=NULL","带头结点的单链表head为空的判定条件是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],229923281,[36,37,38,39],"必定","必定不","可能不","可能","线性表采用顺序存储结构时,逻辑上相邻的元素物理上( )相邻",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],229923282,[45,46,47,48],"双向循环链表","单链表","双向链表","单循环链表","在下列链表中不能从当前结点出发访问到其余各结点的是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":54,"source":30,"type":31},[],229923283,[9,11,8,10],"顺序表中,插入一个元素所需移动的元素平均数是( )",{"answer":56,"createTime":5,"id":57,"options":58,"question":62,"source":30,"type":31},[],229923284,[59,60,46,61],"仅有尾指针的单循环链表","仅有头指针的双向链表","仅有头指针的单循环链表","某线性表中最常用的操作是在最后一个元素之后插入一个元素和删除第一个元素,则采用( )存储方式最节省运算时间",{"answer":64,"createTime":5,"id":65,"options":66,"question":71,"source":30,"type":31},[],229923285,[67,68,69,70],"除第一个和最后一个元素外,其余每个元素都有一个且仅有一个直接前驱和直接后继","每个元素都有一个直接前驱和一个直接后继","线性表中至少要有一个元素","表中诸元素的排列顺序必须是由小到大或由大到小","线性表L=(a1,a2,……,an),下列说法正确的是( )",{"answer":73,"createTime":5,"id":6,"options":74,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":76,"createTime":5,"id":77,"options":78,"question":83,"source":30,"type":31},[],229923287,[79,80,81,82],"只支持顺序访问,不支持直接访问","需要预分配空间","在表尾删除元素时,删除效率最高","在表首插入元素时,插入效率最低","下面关于顺序表的说法错误的是( )",{"answer":85,"createTime":5,"id":86,"options":87,"question":88,"source":30,"type":31},[],229923288,[9,8,11,10],"在顺序表中,删除一个元素平均需要移动( )个元素",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],229923289,[93,94,95,96],"O(n)","O(log3 n)","O(\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2815196056c8a054360d9b1c86374fd5.webp\">)","O(1)","在单链表中结点p之前插入新结点的时间复杂度为( )"]