[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fb1Yyx_1NOimkOkMbN5vJMDmPnJvVQCgDM8DNH51RyAs":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-07-07 09:29:04",157668177,[8,9,10,11],"树的先根遍历序列与其对应的二叉树的先序遍历相同","树的后根遍历序列与其对应的二叉树的后序遍历相同","树的先根遍历序列与其对应的二叉树的中序遍历相同","以上都不对",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},429,"00c6f58b81daf079538a9c3c0aec9e6e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F22ad777326c114fbc0eaa1e857a9c66d.png","数据结构与算法","exam_131116995","自测202407070823","一棵树可转换成为与其对应的二叉树,则下面叙述正确的是",[21,32,41,50,59,68,77,85,88,97],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],157668170,[25,26,27,28],"与图的顶点数和边数都有关","只与图的边数有关","只与图的顶点数有关","与边数的平方有关","用邻接表存储图所用的空间大小( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],157668171,[36,37,38,39],"16902","16904","14454","答案A, B, C均不对","假设有60行70列的二维数组a[1…60, 1…70]以列序为主序顺序存储,其基地址为10000,每个元素占2个存储单元,那么第32行第58列的元素a[32,58]的存储地址为 .(无第0行第0列元素)",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],157668172,[45,46,47,48],"性质相同","特定关系","相同运算","数据项","数据结构是具有( )的数据元素的集合",{"answer":51,"createTime":5,"id":52,"options":53,"question":58,"source":30,"type":31},[],157668173,[54,55,56,57],"1","20","0","21","在有51个结点的完全二叉树中,度为1的结点个数是( ).【南京大学2014年】",{"answer":60,"createTime":5,"id":61,"options":62,"question":67,"source":30,"type":31},[],157668174,[63,64,65,66],"直接选择排序","二分法插入排序","希尔排序","快速排序","下列排序中,哪一个是稳定的排序( ).【北方交通大学2001年】",{"answer":69,"createTime":5,"id":70,"options":71,"question":76,"source":30,"type":31},[],157668175,[72,73,74,75],"问题的规模","变量的多少","问题的难度","A和B","算法的时间复杂度取决于( )",{"answer":78,"createTime":5,"id":79,"options":80,"question":84,"source":30,"type":31},[],157668176,[81,82,48,83],"表元素","数据元素","信息项","线性表是具有n个( )的有限序列",{"answer":86,"createTime":5,"id":6,"options":87,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":89,"createTime":5,"id":90,"options":91,"question":96,"source":30,"type":31},[],157668178,[92,93,94,95],"BA+141","BA+180","BA+222","BA+225","设有数组A[i][j],数组的每个元素长度为3字节,i=1,2,…,8,j=1,2,…,10,数组从内存首地址BA开始顺序存放.当数组以列为主序存放元素时,元素A[5][8]的存储首地址为[ ]",{"answer":98,"createTime":5,"id":99,"options":100,"question":105,"source":30,"type":31},[],157668179,[101,102,103,104],"广义表","二叉树","稀疏矩阵","串","以下数据结构中,哪一个是线性结构( ).【北方交通大学2001年】"]