[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fG4wS2AEIw7isiBGdSf0Qx8hz0VwQ3gqbLr4qzoj7e6w":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2024-07-06 21:49:21",157648044,[8,9,10,11],"4","5","2","3",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},9,"00c6f58b81daf079538a9c3c0aec9e6e","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F22ad777326c114fbc0eaa1e857a9c66d.png","数据结构与算法","exam_131103273","22级阶段测试5","用希尔排序方法对一个数据序列进行排序时,若第一趟排序结果为9,1,4,13,7,8,20,23,15,则该趟排序采用的增量(间隔)可能是( ).【全国试题2014年】",[21,26,35,44,53,62,71,80,89],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],157648045,[30,31,32,33],"栈","线性表","队列","以上都不是","以下数据结构中元素之间为非线性关系的是( ).【武汉大学2015年】",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],157648046,[39,40,41,42],"top1+top2==n","top1-top2==1","top2-top1==1","top1==top2","若双栈共享空间S[0...n-1],初始时top1=-1,top2=n,则判栈满为真的条件是( ).【北京邮电大学2016年】",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":24,"type":25},[],157648047,[48,49,50,51],"下三角","对称","上三角","稀疏","无向网(加权图)的邻接矩阵是( )矩阵",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":24,"type":25},[],157648048,[57,58,59,60],"空串是由空格构成的串","串既可以采用顺序存储,也可以采用链式存储","模式匹配是串的一种重要运算","串是字符的有限序列","下面关于串的叙述中,哪一个是不正确的( ).【北方交通大学2001年】",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":24,"type":25},[],157648050,[66,67,68,69],"满二叉树","完全二叉树","二叉排序树","线索二叉树","当结点数目一定时,具有最小深度的二叉树是( ).【北京航天航空大学2005年】",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":24,"type":25},[],157648051,[75,76,77,78],"首结点和尾结点两个指针","任何结点指针","尾结点指针","首结点指针","若用一个不带头结点的循环单链表表示队列,则最好用( )标识链队.【四川大学2016年】",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":24,"type":25},[],157648052,[84,85,86,87],"O(n)","O(log2n)","O(n2)","O(1)","设二叉排序树中有n个结点,则二叉排序树的平均查找长度为( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":24,"type":25},[],157648053,[93,94,95,96],"单链表","双链表","仅有头指针的单循环链表","仅有尾指针的单循环链表","如果线性表中最常用的操作是在最后一个元素之后插入和删除第一个数据元素,则采用( )存储方式最节省运算时间.【北京大学2015年】"]