[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fa836xpe6NHVGx5q4lYC98gM3LYXVXX23vjYQnzzmmDI":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-12-27 13:46:19",289307312,[8,9,10,11],"二叉树","栈","图","树",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},39,"1e20f3e464666c92dc37d29542751b13","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F25b30343053994e8940089572d36015b.jpg","数据结构","work_49269496","选择题作业","具有线性结构的数据结构是( )",[21,32,41,50,59,68,76,85,94,103],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],289307303,[25,26,27,28],"紧凑结构和非紧凑结构","线性结构和非线性结构","内部结构和外部结构","动态结构和静态结构","在数据结构中,从逻辑上可以把数据结构分为( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],289307304,[36,37,38,39],"n2","n(n-1)","n(n-1)\u002F2","n2-1","设某完全无向图中有n个顶点,则该完全无向图中有( )条边",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],289307305,[45,46,47,48],"访问第i个结点(1≤i≤n)和求第i个结点的直接前驱(2≤i≤n)","删除第i个结点(1≤i≤n)","在第i个结点后插入一个新结点(1≤i≤n)","将n个结点从小到大排序","在n个结点的顺序表中,算法的时间复杂度是O(1)的操作是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],289307306,[54,55,56,57],"7","8","9","5","设顺序表有9个元素,则在第3个元素前插入一个元素所需移动元素的个数为( )",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],289307307,[63,64,65,66],"3,1,2,5,4,6","1,5,4,6,2,3","5,3,4,6,1,2","3,2,5,6,4,1","设输入序列为1、2、3、4、5、6,则通过栈的作用后可以得到的输出序列为( )",{"answer":69,"createTime":5,"id":70,"options":71,"question":75,"source":30,"type":31},[],289307308,[72,73,74,57],"31","32","16","二叉树的深度为5,则二叉树最多有( )个结点",{"answer":77,"createTime":5,"id":78,"options":79,"question":84,"source":30,"type":31},[],289307309,[80,81,82,83],"最少为1,最多为n-1","最少为1,最多为n","最少为0,最多为n","最少为0,最多为n-1","对于长度为n的顺序表执行删除操作,则其结点的移动次数( )",{"answer":86,"createTime":5,"id":87,"options":88,"question":93,"source":30,"type":31},[],289307310,[89,90,91,92],"p->next=p","p=p->next->next","p->next=p->next->next","p=p->next","设单链表中指针p指向结点A,若删除A的直接后续结点存在,则需要修改指针的操作为( )",{"answer":95,"createTime":5,"id":96,"options":97,"question":102,"source":30,"type":31},[],289307311,[98,99,100,101],"30","20","40","45","设一组权值集合W={2,3,4,5,6},则由该权值集合构造的哈夫曼树中带权路径长度之和为( )",{"answer":104,"createTime":5,"id":6,"options":105,"question":19,"source":30,"type":31},[],[8,9,10,11]]