成考院校在线答案
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:widow-orphan;text-align:justify;text-justify:inter-ideograph;">30、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设一棵二叉树的深度为k,则该二叉树中最多有( )个结点。</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">35、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设二叉树的先序遍历序列和后序遍历序列正好相反,则该二叉树满足的条件是( )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">32、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">下列广义表是线性表的有</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">35、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">若有18个元素的有序表存放在一维数组A[19]中,第一个元素放A[1]中,现进行二分查找,则查找A[3]的比较序列的下标依次为( )</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">18、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设顺序循环队列Q[0:M-1]的头指针和尾指针分别为F和R,头指针F总是指向队头元素的前一位置,尾指针R总是指向队尾元素的当前位置,则该循环队列中的元素个数为( )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">18、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某棵三叉树中有40个结点,则该三叉树的最小高度为( )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="p" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:widow-orphan;text-align:justify;text-justify:inter-ideograph;">19、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:12.0000pt;mso-font-kerning:1.0000pt;">设某数据结构的二元组形式表示为A=(D,R),D={01,02,03,04,05,06,07,08,09},R={r},r={<01,02>,<01,03>,<01,04>,<02,05>,<02,06>,<03,07>,<03,08>,<03,09>},则数据结构A是( )。</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:widow-orphan;text-align:justify;text-justify:inter-ideograph;">39、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某链表中最常用的操作是在链表的尾部插入或删除元素,则选用下列( )存储方式最节省运算时间。</span><span style="font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">24、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设某有向图中有n个顶点,则该有向图对应的邻接表中有( )个表头结点。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>
- 2022-09-12 [单选] <p class="MsoNormal" align="justify" style="margin-top:0.0000pt;margin-right:0.0000pt;margin-bottom:0.0000pt;margin-left:0.0000pt;mso-pagination:none;text-align:justify;text-justify:inter-ideograph;">25、<span style="mso-spacerun:'yes';font-family:Microsoft Yahei;color:rgb(0,0,0);font-size:10.5000pt;mso-font-kerning:1.0000pt;">设一组权值集合W=(15,3,14,2,6,9,16,17),要求根据这些权值集合构造一棵哈夫曼树,则这棵哈夫曼树的带权路径长度为( )。</span><span style="font-family:Microsoft Yahei;font-size:12.0000pt;mso-font-kerning:1.0000pt;"> <o:p></o:p></span></p>