[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f5SqStl1j645ch4QIm95ULY8R12k_lKQR6lx1n8HgaF4":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-06-21 01:16:21",153896042,[8,9,10,11],"5,4,3,6,1,2","4,5,3,1,2,6","3,4,6,5,2,1","2,3,4,1,5,6",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},109,"2681c5268f8f5d4eb2e26fec9da35bf7","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff8636953406ec34c8c3936b1de49d95b.jpg","数据结构（python语言描述）","exam_126969300","242","有6个元素以6,5,4,3,2,1的顺序进栈,()不是合法的出栈序列",[21,32,41,50,57,66,69,78,87,96],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],153896037,[25,26,27,28],"栈","队列","链表","哈希表","以下哪种数据结构最适合实现先进先出( )特性","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],153896038,[36,37,38,39],"h","2h-1","2h+1","h+1","设高度为h的二叉树上只有度为0和度为2的结点,则此类二叉树中所包含的结点数至",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],153896039,[45,46,47,48],"10","11","13","15","已知无向图G 含有16条边,其中度为4的顶点个数为3,度为3的顶点个数为4,其他顶点 的度均小于3.图G 所含的顶点个数至少是( )",{"answer":51,"createTime":5,"id":52,"options":53,"question":56,"source":30,"type":31},[],153896040,[54,45,48,55],"3","25","若用冒泡排序算法对序列{10,14,26,29,41,52}从大到小排序,需进行( )次 比较",{"answer":58,"createTime":5,"id":59,"options":60,"question":65,"source":30,"type":31},[],153896041,[61,62,63,64],"O(1)","O(n)","O(n²)","O(nlog₂n)","给定有n 个元素的一维数组,建立一个有序单链表的最低时间复杂度是( )",{"answer":67,"createTime":5,"id":6,"options":68,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":30,"type":31},[],153896043,[73,74,75,76],"i(i-1)\u002F2+j-1","i(i+1)\u002F2+j","i(i+1)\u002F2+j-1","i(i-1)\u002F2+j","设若矩阵A是一个对称矩阵,为了节省存储空间,将其下三角部分按照行优先存放在一维数组B[0,... ,n(n+1)\u002F2-1]中,对于下三角部分中的任一元素ai,j(i>=j,i和j从1开始取值),在一维数组B中的下标k的值是",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":30,"type":31},[],153896044,[82,83,84,85],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6432e9ac6ac336710f911b9295516b7d.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F53e38b8652c1832fcefdf9669e33a049.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F72785c0532ccc8ac73e9589041019128.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fdbbb8879bc2a19bdf6e0edc82664d744.png\">","高度为h 的完全二叉树最少有( )个结点",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":30,"type":31},[],153896045,[91,92,93,94],"A.I","B.Ⅱ 、Ⅲ","C.I 、Ⅱ","D.I 、Ⅱ 、Ⅲ","在 n 个元素的线性表的数组表示中,以下时间复杂度为O(1)的操作是( ). I. 访问第i 个结点(1<i<n) 和求第i 个结点的直接前驱(2<i≤n) Ⅱ.在最后一个结点后插入一个新的结点 Ⅲ.删除第1个结点 IV. 在 第i个结点后插入一个结点(1<i<n)",{"answer":97,"createTime":5,"id":98,"options":99,"question":104,"source":30,"type":31},[],153896046,[100,101,102,103],"O(n),O(n)",".O(n),O(1)",".O(1),O(n)","O(1),O(1)","对于顺序表,访问第i 个位置的元素和在第i 个位置插入一个元素的时间复杂度为( )"]