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