[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$ft69ZY6wjXF6XjPti5iN_eSsmKrWyvhNRsnFqEd7GAi0":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2024-11-28 14:08:27",167878803,[8,9,10,11],"1+b+3c","1+2b+3c","2b+3c","1+b+2c",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},63,"e4caeb0586c93542922820e82e4d66d7","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9c1e48361b00f3ee2086f4e259ed792b.jpg","数据结构","work_39218891","作业七 树(论述题,手写,拍照上传)","若3次树中有a个度为1的结点,b个度为2的结点,c个度为3的结点,则该树中有( )个叶子 结点",[21,32,41,50,53,62,71,80,89,98],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],167878800,[25,26,27,28],"树的高度最多是n-3","树的高度最多是n-4","第i层上最多有4(i-1)个结点","至少在某一层上正好有4个结点","对于一棵具有n个结点,度为4的树来说,( )","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],167878801,[36,37,38,39],"至少有h+3个结点","最多有\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcc3df5234f294ea024f400be093a689d.png\">个结点","最多有4h个结点","至少有h+4个结点","度为4,高度为h的树()",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],167878802,[45,46,47,48],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9b79e844d66784855a97511d8fd2b698.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff2f8f5e2bb38d0d9afabc22157ec0e65.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F456b93c79861caa66f352c74edfce957.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe70e96e5ae534da8987126019f6f22cb.png\">","对于一棵具有n个结点,度为4的树来说,树的高度至少是( )",{"answer":51,"createTime":5,"id":6,"options":52,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],167878804,[57,58,59,60],"A","B","J","以上都不对","假设一棵树中每个结点值为单个字符,其层次遍历序列为ABCDEFGHIJ,则根结点的值是( )",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":30,"type":31},[],167878805,[66,67,68,69],"找指定结点的双亲结点","找指定结点的孩子结点","找指定结点的兄弟结点","判断某结点是不是叶子结点","用双亲存储结构表示树,其优点之一是比较方便( )",{"answer":72,"createTime":5,"id":73,"options":74,"question":79,"source":30,"type":31},[],167878806,[75,76,77,78],"判断两个指定结点是不是兄弟","找指定结点的双亲","判断指定结点在第几层","计算指定结点的度数","用孩子链存储结构表示树,其优点之一是( )比较方便",{"answer":81,"createTime":5,"id":82,"options":83,"question":88,"source":30,"type":31},[],167878807,[84,85,86,87],"5%","45%","70%","90%","当一棵树度为10,结点个数秋n(n>100)的树采用孩子链存储结构时,期中非空指针域数占总指针域数的比例约为( )",{"answer":90,"createTime":5,"id":91,"options":92,"question":97,"source":30,"type":31},[],167878808,[93,94,95,96],"7","6","5","个数不能确定","如果某棵树的孩子兄弟链存储结构中有6个空的左指针域,7个空的右面指针域,5个结点的左、右指针域都是空的,则该树中的叶子结点( )",{"answer":99,"createTime":5,"id":100,"options":101,"question":106,"source":30,"type":31},[],167878809,[102,103,104,105],"m1","m1+m2","m3","m2+m3","设森林F中有3棵树,第一、第二、第三棵树的结点个数分别为m1,m2和m3.与森林F对应的二叉树根结点的右子树上的结点个数是( )"]