[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fZXS9PDeoaoc4f1P3Zlt-c0EoTmGehJHe2FVwCE_YoRQ":3},{"id":4,"source":5,"question":6,"options":7,"answer":8,"related":9,"type":107,"origin":108,"createTime":22},245089809,"v1","二叉树中每个结点有两棵非空子树或有两棵空子树",[],[],[10,23,33,43,53,61,71,80,90,100],{"id":11,"source":5,"question":12,"options":13,"answer":18,"related":19,"type":20,"origin":21,"createTime":22},245089783,"某二叉树共有7个结点,其中叶子结点只有1个,则该二叉树的深度为(假设根结点 在第1层)",[14,15,16,17],"3","4","6","7",[],[],0,null,"2025-11-29T12:13:05+08:00",{"id":24,"source":5,"question":25,"options":26,"answer":31,"related":32,"type":20,"origin":21,"createTime":22},245089784,"在深度为7的满二叉树中,度为2的结点个数为",[27,28,29,30],"64","63","32","31",[],[],{"id":34,"source":5,"question":35,"options":36,"answer":41,"related":42,"type":20,"origin":21,"createTime":22},245089785,"某二叉树中有n个叶子结点,则该二叉树中度为2的结点数为",[37,38,39,40],"n+1","n-1","2n","n\u002F2",[],[],{"id":44,"source":5,"question":45,"options":46,"answer":51,"related":52,"type":20,"origin":21,"createTime":22},245089786,"深度为5的完全二叉树的结点数不可能是",[47,48,49,50],"15","16","17","18",[],[],{"id":54,"source":5,"question":55,"options":56,"answer":59,"related":60,"type":20,"origin":21,"createTime":22},245089787,"深度为7的完全二叉树中共有125个结点,则该完全二叉树中的叶子结点数为",[57,28,27,58],"62","65",[],[],{"id":62,"source":5,"question":63,"options":64,"answer":69,"related":70,"type":20,"origin":21,"createTime":22},245089788,"设某二叉树中共有140个结点,其中有41个度为1的结点.则",[65,66,67,68],"该二叉树中有51个叶子结点","该二叉树中有50个叶子结点","该二叉树中有51个度为2的结点","该二叉树中有50个度为2的结点",[],[],{"id":72,"source":5,"question":73,"options":74,"answer":78,"related":79,"type":20,"origin":21,"createTime":22},245089789,"某二叉树的深度为7,其中有64个叶子结点,则该二叉树中度为1的结点数为",[75,76,77,28],"0","1","2",[],[],{"id":81,"source":5,"question":82,"options":83,"answer":88,"related":89,"type":20,"origin":21,"createTime":22},245089790,"一棵二叉树中共有80个叶子结点与70个度为1的结点,则该二叉树中的总结点数为",[84,85,86,87],"219","229","230","231",[],[],{"id":91,"source":5,"question":92,"options":93,"answer":98,"related":99,"type":20,"origin":21,"createTime":22},245089791,"设某二叉树的前序序列为ABC,中序序列为CBA,则该二叉树的后序序列为",[94,95,96,97],"BCA","CBA","ABC","CAB",[],[],{"id":101,"source":5,"question":102,"options":103,"answer":105,"related":106,"type":20,"origin":21,"createTime":22},245089792,"某二叉树的前序序列为ABCDEFG,中序序列为DCBAEFG,则该二叉树的深度(根结点在第1层)为",[77,14,15,104],"5",[],[],3,{"courseName":109,"courseImg":110,"workName":111,"workId":112,"count":113,"courseId":114},"数据结构","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F48eba3395437dd881b1b9275a0ad1028.png","红外光谱作业1","work_48520056",36,"3c4c2480355d282f760d58de370bd1e9"]