[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$f48kr-wIi3Gr9pPvvXiTIpIhsaDkguwCOHaOAIqPSPY0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":16,"related":17,"source":21,"type":22},[],"2023-05-07 21:18:14",923391105,[8,9],"对","错",{"courseId":11,"courseImg":12,"courseName":13,"workId":14,"workName":15},"1000076957","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe9518702fb10fa138ff87a013770ea89.jpg","数据结构轻松学","45822329","第六章单元测试","完全二叉树中除最后一层外,其余层都是满的,并且最后一层的左边缺少连续若干个结点.( )",[18,23,28,33,43,52,61,70,75,80],{"answer":19,"createTime":5,"id":6,"options":20,"question":16,"source":21,"type":22},[],[8,9],"v2",3,{"answer":24,"createTime":5,"id":25,"options":26,"question":27,"source":21,"type":22},[],923391109,[8,9],"哈弗曼树中权值较大的叶子结点一般离根节点较近,权值较小的叶子结点一般离根结点较远.( )",{"answer":29,"createTime":5,"id":30,"options":31,"question":32,"source":21,"type":22},[],923391158,[8,9],"若满二叉树的结点数为n,则其高度为log2(n+1).( )",{"answer":34,"createTime":5,"id":35,"options":36,"question":41,"source":21,"type":42},[],923391160,[37,38,39,40],"8","9","10","11","具有10个叶结点的二叉树中至少有( )个度为2的结点",0,{"answer":44,"createTime":5,"id":45,"options":46,"question":51,"source":21,"type":42},[],923391163,[47,48,49,50],"2","3","4","5","由3个结点可以构造出多少种不同的二叉树?( )",{"answer":53,"createTime":5,"id":54,"options":55,"question":60,"source":21,"type":42},[],923391166,[56,57,58,59],"2n","n-1","n+1","n","n个结点的线索二叉树(不含头结点)中含有的线索个数为( )",{"answer":62,"createTime":5,"id":63,"options":64,"question":69,"source":21,"type":42},[],923391168,[65,66,67,68],"先序遍历序列的最后一个结点是根结点","先序遍历序列的最后一个结点一定是叶子结点","先遍历序列的第一个结点一定是叶子结点","全部都不对","关于非空二叉树的先序遍历序列中,以下正确的是( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":74,"source":21,"type":22},[],923391170,[8,9],"树形结构中元素之间存在一个对多个的关系.( )",{"answer":76,"createTime":5,"id":77,"options":78,"question":79,"source":21,"type":22},[],923391171,[8,9],"度为m的树,至少有一个结点的度为m,且没有度大于m的结点.( )",{"answer":81,"createTime":5,"id":82,"options":83,"question":84,"source":21,"type":22},[],923391173,[8,9],"树的存储结构主要有双亲存储结构、孩子链存储结构和孩子兄弟链存储结构.( )"]