[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fmADkXUpVCQDzn_gcAYOWijFgDL5hvROCgIanWiz8Q_E":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":13,"related":14,"source":20,"type":21},[],"2024-12-16 12:59:46",997098725,[8,9],"对","错",{"courseImg":11,"courseName":12},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff88d4a0e1079ea7b442e81ef4f058900.jpg","[共享课]数据结构与算法基础","当记录个数小于哈希表长度时,哈希查找平均查找长度必然为0.( )",[15,22,33,36,41,46,51,60,65,74],{"answer":16,"createTime":5,"id":17,"options":18,"question":19,"source":20,"type":21},[],997098684,[8,9],"数据元素是数据的最小单位.( )","v2",3,{"answer":23,"createTime":24,"id":25,"options":26,"question":31,"source":20,"type":32},[],"2024-12-16 12:59:45",997098691,[27,28,29,30],"需不断对L进行删除插入","需经常修改L中的结点值","L中含有大量的结点","L中含有少量的结点","线性表L在( )情况下适用于使用链式结构实现",0,{"answer":34,"createTime":5,"id":6,"options":35,"question":13,"source":20,"type":21},[],[8,9],{"answer":37,"createTime":5,"id":38,"options":39,"question":40,"source":20,"type":21},[],997098828,[8,9],"邻接矩阵适用于有向图和无向图的存储,但不能存储带权的有向图和无向图,而只能使用邻接表存储形式来存储它.( )",{"answer":42,"createTime":5,"id":43,"options":44,"question":45,"source":20,"type":21},[],997098850,[8,9],"顺序存储设计时,存储单元的地址一定连续.( )",{"answer":47,"createTime":5,"id":48,"options":49,"question":50,"source":20,"type":21},[],997098861,[8,9],"二叉树中除叶子结点外,任一结点X,其左子树根结点的值小于该结点(X)的值;其右子树根结点的值≥该结点(X)的值,则此二叉树一定是二叉排序树.( )",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":20,"type":32},[],997098903,[55,56,57,58],"V1 V3 V4 V5 V2","V1 V3 V2 V4 V5","V1 V2 V3 V4 V5","V1 V2 V3 V5 V4","已知图的邻接表如图所示("\u002F"表示空指针),则从顶点v1出发按广度优先遍历的结果是( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6080b3154f94791c27e2c4ad887a93b1.png\">",{"answer":61,"createTime":5,"id":62,"options":63,"question":64,"source":20,"type":21},[],997098943,[8,9],"数据的逻辑结构与数据元素本身的内容和形式无关.( )",{"answer":66,"createTime":24,"id":67,"options":68,"question":73,"source":20,"type":32},[],997098962,[69,70,71,72],"O(1)","O(n)","O(i)","O(i-1)","线性表(a1​,a2​,…,an​)以仅有头指针的单链表存储时,访问第i位置元素的时间复杂度为( )",{"answer":75,"createTime":5,"id":76,"options":77,"question":78,"source":20,"type":21},[],997099015,[8,9],"如果表示图的邻接矩阵是对称矩阵,则该图一定是无向图.( )"]