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