[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fGw2A2QSDFVjYAkJghE_AXqfnpq9o19li_n1Z7_hJO48":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":15,"related":16,"source":26,"type":27},[],"2025-12-27 08:41:30",1077403539,[8,9,10,11],"100","257","219","236",{"courseImg":13,"courseName":14},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff841c184e963b4b58f49651a1094e72f.png","[共享课]数据结构（宁夏大学）","设一组权值集合W=(5,25,3,6,10,11,36,4),要求根据这些权值集合构造一棵哈夫曼树,则这棵哈夫曼树的带权路径长度为( )",[17,28,37,46,55,64,73,83,92,95],{"answer":18,"createTime":5,"id":19,"options":20,"question":25,"source":26,"type":27},[],1077403446,[21,22,23,24],"Data","structure","Datastructure","DATA","函数substr("I like Datastructure.",8,4)的返回值为( )","v2",0,{"answer":29,"createTime":5,"id":30,"options":31,"question":36,"source":26,"type":27},[],1077403460,[32,33,34,35],"17","13","18","15","深度为4的二叉树至多可以有的结点数为( )",{"answer":38,"createTime":5,"id":39,"options":40,"question":45,"source":26,"type":27},[],1077403489,[41,42,43,44],"O(n)","O(n2)","O(nlog2n)","O(log2n)","直接选择排序的时间复杂度为( )(n 为元素个数)",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":26,"type":27},[],1077403510,[50,51,52,53],"8","9","37","36","若串str="DataBase",其子串的数目是( )",{"answer":56,"createTime":5,"id":57,"options":58,"question":63,"source":26,"type":27},[],1077403517,[59,60,61,62],"0,1,4,2,7,3,8,6,5,9","0,1,2,8,3,4,5,6,7,9","0,4,3,8,9,5,6,7,1,2","0,4,1,3,7,2,8,6,9,5","已知一个图的顶点集V和边集E如下:V = {0,1,2,3,4,5,6,7,8,9};E = {(0,1),(0,4),(1,2),(1,7),(2,8),(3,4),(3 ,8),(5,6),(5,8),(5,9),(6,7),(7,8),(8,9)}用广度优先遍历的序列是( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":72,"source":26,"type":27},[],1077403527,[68,69,70,71],"顺序存储结构","链式存储结构","索引存储结构","散列存储结构","邻接表是图的一种( )",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":26,"type":82},[],1077403529,[77,78,79,80],"0 1 3 2 5 4","0 1 4 5 3 2","0 2 3 1 5 4","0 3 2 1 5 4","下图从0点出发的广度优先遍历的顺序有( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6b88f29fa99bc9cb8ad76312af3d6ddc.png\">",1,{"answer":84,"createTime":5,"id":85,"options":86,"question":91,"source":26,"type":27},[],1077403536,[87,88,89,90],"是一个有根有向图","是个强连通图","含有多个入度为0的顶点","含有顶点个数大于1的强连通分量","若一个有向图中的顶点不能排成一个拓扑序列,则可以断定该有向图( )",{"answer":93,"createTime":5,"id":6,"options":94,"question":15,"source":26,"type":27},[],[8,9,10,11],{"answer":96,"createTime":5,"id":97,"options":98,"question":103,"source":26,"type":27},[],1077403545,[99,100,101,102],"数字分析法、除余法、平方取中法","数字分析法、除余法、线性探测法","数字分析法、线性探测法","线性探测法、拉链地址法","解决散列法中出现的冲突问题常采用的方法是( )"]