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