[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f3tPJHFv_TUmsmehfZnHAhBoqh_Mba3mBBOBxtyU9q08":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-12-27 16:22:46",174499504,[8,9,10,11],"追加,删除","插入,删除","入栈,出栈","出栈,入栈",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},71,"ff404fa25e36b29e2c6819f77e3dd9b4","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fbb062ff6068e05b64e1dc4486da29b2a.jpg","24数据结构","exam_144259701","数据结构练习题","栈的插入操作被称为 ________,删除操作被称为 ________",[21,32,41,50,59,68,77,86,92,101],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],174499495,[25,26,27,28],"O(n^2)","O(logn)","O(n)","O(1)","下列时间复杂度中最坏的是( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],174499496,[36,37,38,39],"n-2w-1","n-2w+1","n-2w","n-w+1","有一颗非空的二叉树,共有n个结点,其中度为2的结点有w个,则度为1的结点个数为",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],174499497,[45,46,47,48],"127","0","63.5","63","向一个有127个元素的顺序表中插入一个新元素并保持原来顺序不变,平均要移动( )个元素",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],174499498,[54,55,56,57],"仅有尾指针的单循环链表","双链表","仅有头指针的单循环链表","单链表","某线性表中最常用的操作是在最后一个元素之后插入一个元素和删除第一个元素,则采用哪种存储方式最节省运算时间",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],174499499,[63,64,65,66],"一般矩阵","对角矩阵","稀疏矩阵","对称矩阵","若无向图采用邻接矩阵存储,则该邻接矩阵是()",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],174499500,[72,73,74,75],"80","81","64","82","已知权值 W={ 5,8,4,9,3,4 },构造哈夫曼树的WPL(最短带权路径长度)为",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":30,"type":31},[],174499501,[81,82,83,84],"2","1","3","4","顺序表中,如果有4个数据,要在第二个位置插入一个数据,需向后移动( )个数据",{"answer":87,"createTime":5,"id":88,"options":89,"question":91,"source":30,"type":31},[],174499502,[84,81,82,90],"1\u002F2","在一个有向图中,所有顶点入度之和等于所有顶点出度之和的几倍",{"answer":93,"createTime":5,"id":94,"options":95,"question":100,"source":30,"type":31},[],174499503,[96,97,98,99],"n-1","n","n(n-1)","n(n-1)\u002F2","n个顶点的无向完全图有()条边",{"answer":102,"createTime":5,"id":6,"options":103,"question":19,"source":30,"type":31},[],[8,9,10,11]]