[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fgK_KPraMQmUj_oK5F3HR7rfKd_uSM5M6Fli7UpVewoQ":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":24,"type":25},[],"2023-12-21 11:13:59",118819006,[8,9,10,11],"O(nlgn)","O(n3)","O(n2)","O(n)",{"courseId":13,"courseImg":14,"courseName":15},"c7fc408762ed256dcd0155353552972d","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9b42e067d0b0784b06a988cb0707ce38.png","算法导论","递归式 \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6b220faa29fa7f019a922c4ffaba691e.webp\"> 的解为( )",[18,26,35,42,51,60,70,79,88,97],{"answer":19,"createTime":20,"id":21,"options":22,"question":23,"source":24,"type":25},[],"2023-12-21 11:13:57",118818983,[11,10,9,8],"下面代码段的时间复杂度为( ) \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fddfdd0e01acdc1666d6c8104e40997f6.png\">","v1",0,{"answer":27,"createTime":20,"id":28,"options":29,"question":34,"source":24,"type":25},[],118818985,[30,31,32,33],"4","5","6","7","在一棵三元树中度为 3 的结点数为 2 个,度为 2 的结点数为 1 个,度为 1 的结点数为 2 个,则度为 0 的结点数为( )个",{"answer":36,"createTime":20,"id":37,"options":38,"question":41,"source":24,"type":25},[],118818986,[39,40,11,8],"O(lgn)","O(1)","在对n 个元素的序列进行排序时,堆排序所需要的附加存储空间是( )",{"answer":43,"createTime":20,"id":44,"options":45,"question":50,"source":24,"type":25},[],118818991,[46,47,48,49],"n","n^2","nlgn","lgn","归并排序的时间复杂度是",{"answer":52,"createTime":20,"id":53,"options":54,"question":59,"source":24,"type":25},[],118818993,[55,56,57,58],"二叉树的度为 2","一棵二叉树的度可以小于 2","二叉树中至少有一个结点的度为 2","二叉树中任何一个结点的度都为 2","有关二叉树下列说法正确的是( )",{"answer":61,"createTime":62,"id":63,"options":64,"question":69,"source":24,"type":25},[],"2023-12-21 11:13:58",118818995,[65,66,67,68],"最优子结构性质与贪心选择性质","重叠子问题性质与贪心选择性质","最优子结构性质与重叠子问题性质","预排序与递归调用","动态规划算法的基本要素为()",{"answer":71,"createTime":62,"id":72,"options":73,"question":78,"source":24,"type":25},[],118819000,[74,75,76,77],"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":80,"createTime":62,"id":81,"options":82,"question":87,"source":24,"type":25},[],118819003,[83,84,85,86],"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":89,"createTime":62,"id":90,"options":91,"question":96,"source":24,"type":25},[],118819005,[92,93,94,95],"\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":98,"createTime":5,"id":6,"options":99,"question":16,"source":24,"type":25},[],[8,9,10,11]]