[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fIYlM8-pDyzv9fTWx4Ao2TA0imD677O4F8UDl0ocJm3E":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":14,"related":15,"source":26,"type":105},[],"2023-12-21 11:14:21",118819903,[8,9],"正确","错误",{"courseId":11,"courseImg":12,"courseName":13},"c7fc408762ed256dcd0155353552972d","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9b42e067d0b0784b06a988cb0707ce38.png","算法导论","插入排序、快速排序和桶排序都属于比较排序算法",[16,28,37,44,53,62,72,81,90,99],{"answer":17,"createTime":18,"id":19,"options":20,"question":25,"source":26,"type":27},[],"2023-12-21 11:13:57",118818983,[21,22,23,24],"O(n)","O(n2)","O(n3)","O(nlgn)","下面代码段的时间复杂度为( ) \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fddfdd0e01acdc1666d6c8104e40997f6.png\">","v1",0,{"answer":29,"createTime":18,"id":30,"options":31,"question":36,"source":26,"type":27},[],118818985,[32,33,34,35],"4","5","6","7","在一棵三元树中度为 3 的结点数为 2 个,度为 2 的结点数为 1 个,度为 1 的结点数为 2 个,则度为 0 的结点数为( )个",{"answer":38,"createTime":18,"id":39,"options":40,"question":43,"source":26,"type":27},[],118818986,[41,42,21,24],"O(lgn)","O(1)","在对n 个元素的序列进行排序时,堆排序所需要的附加存储空间是( )",{"answer":45,"createTime":18,"id":46,"options":47,"question":52,"source":26,"type":27},[],118818991,[48,49,50,51],"n","n^2","nlgn","lgn","归并排序的时间复杂度是",{"answer":54,"createTime":18,"id":55,"options":56,"question":61,"source":26,"type":27},[],118818993,[57,58,59,60],"二叉树的度为 2","一棵二叉树的度可以小于 2","二叉树中至少有一个结点的度为 2","二叉树中任何一个结点的度都为 2","有关二叉树下列说法正确的是( )",{"answer":63,"createTime":64,"id":65,"options":66,"question":71,"source":26,"type":27},[],"2023-12-21 11:13:58",118818995,[67,68,69,70],"最优子结构性质与贪心选择性质","重叠子问题性质与贪心选择性质","最优子结构性质与重叠子问题性质","预排序与递归调用","动态规划算法的基本要素为()",{"answer":73,"createTime":64,"id":74,"options":75,"question":80,"source":26,"type":27},[],118819000,[76,77,78,79],"T(n)= T(n – 1)+1,T(1)=1","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5918edb1a20c25be2b8889a728a2b218.webp\">","T(n)= T(n\u002F2)+1,T(1)=1","3nlgn","T(n)表示当输入规模为n时的算法效率,以下算法效率最优的是( )",{"answer":82,"createTime":64,"id":83,"options":84,"question":89,"source":26,"type":27},[],118819003,[85,86,87,88],"A*B+C\u002F(D*E)+(F-G)","(A*B+C)\u002F(D*E)+(F-G)","(A*B+C)\u002F(D*E+(F-G))","A*B+C\u002FD*E+F-G","设有一表示算术表达式的二叉树(见下图), 它所表示的算术表达式是( )\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa9bc57d991636f3cc7de2f9be964b061.gif\">\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F92e1b7550a356d1e2d82c9982d768640.png\">",{"answer":91,"createTime":64,"id":92,"options":93,"question":98,"source":26,"type":27},[],118819005,[94,95,96,97],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F4b08b433c84c5c025887ae2d4385d970.webp\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0a266aba8f5e33573e4bdd77ae433356.webp\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fdac2cc43f4dd9a0c1b75b4b6f8e04c82.webp\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0f1b9d5f21f0b8b58e10c46aad6b30de.webp\">","设根结点深度为1,叶子结点高度为1. 高度为 K 的二叉树最大的结点数为( )",{"answer":100,"createTime":101,"id":102,"options":103,"question":104,"source":26,"type":27},[],"2023-12-21 11:13:59",118819006,[24,23,22,21],"递归式 \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6b220faa29fa7f019a922c4ffaba691e.webp\"> 的解为( )",3]