[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f9RBdT0e7Yto9xHcDZW7NVLkD4XRfVLri2Qi7qKJQaGM":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2023-12-22 19:41:19",119738207,[8,9,10,11],"A.8","B. 9","C.10","D.11",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},59,"7260417d0bf6f5e6db26f8161a755e41","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6abe86676881fe0290b5ad5d6b8262f3.jpg","231学期《数据结构与算法（VR）》","31934e53eedd4c90980de83077007d6b","树与二叉树-课堂练习.xls","10.具有10个叶子结点的二叉树中有()个度为2的结点",[21,33,42,51,60,69,78,87,96,105],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2023-12-22 19:41:18",119738191,[26,27,28,29],"A. 有序","B.无序","C.任意元素之间具有多种联系","D.元素之间具有分支层次关系","1.树最适合用来表示()的数据","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],119738192,[37,38,39,40],"A.n-1","B.n","C.n+1","D.2n","2.一棵有n个结点的树的所有结点的度数之和为()",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],119738194,[46,47,48,49],"A.总和","B.最小值","C.最大值","D.平值","3.树的路径长度是从树根到每一结点的路径长度的()",{"answer":52,"createTime":23,"id":53,"options":54,"question":59,"source":31,"type":32},[],119738195,[55,56,57,58],"A.树的高度至多是n-3","B.树的高度至多是n-4","C.第i层上至多有4(i-1)个结点","D.至少在某一层上正好有4个结点","4.对于一棵具有n个结点、度为4的树来说,()",{"answer":61,"createTime":23,"id":62,"options":63,"question":68,"source":31,"type":32},[],119738197,[64,65,66,67],"A.至少有h+3个结点","B.至多有4h-1个结点","C.至多有4h个结点","D.至少有 h+4 个结点","5.度为4、高度为h的树,则( )",{"answer":70,"createTime":23,"id":71,"options":72,"question":77,"source":31,"type":32},[],119738198,[73,74,75,76],"A. 3","B. 4","C. 5","D.6","6.假定一棵度为3的树中结点数为50,则其最小高度为()",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":31,"type":32},[],119738199,[82,83,84,85],"A.41","B.82","C.113","D. 122","7.【2010年计算机联考真题】在一棵度为4的树T中,若有20个度为4的结点,10个度为3的结点,1个度为2的结点,10个度为1的结点,则树T的叶结点个数是( )",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":31,"type":32},[],119738202,[91,92,93,94],"A.度为2的有序树就是二叉树","B.含有N个结点的二叉树其高度为[log2N」+1","C.在完全二叉树中,若一个结点没有左孩子,则它必是叶结点","D.在任意一棵非空二叉排序树中,删除某结点后又将其插入,则所得二叉排序树与删除前原二叉排序树相同","8.下列关于二叉树的说法中,正确的是( )",{"answer":97,"createTime":5,"id":98,"options":99,"question":104,"source":31,"type":32},[],119738203,[100,101,102,103],"A.在完全二叉树中,叶子结点的双亲的左兄弟(如果存在)一定不是叶子结点","B.任何一棵二叉树,叶子结点个数为度为2的结点数减1,即 N0=N2-1","C.完全二叉树不适合存储结构,只有满二叉树适合顺序存储结构","D.结点按完全二叉树层序编号的二叉树中,第i个结点的左孩子的编号为2i","9.以下说法中,正确的是( )",{"answer":106,"createTime":5,"id":6,"options":107,"question":19,"source":31,"type":32},[],[8,9,10,11]]