[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fskKiQzw9V-Vj41BpjShRb1C2Hx8CBfDytsvHqQoDTFI":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":17,"related":18,"source":22,"type":23},[],"2024-12-01 23:17:14",168468970,[8,8,8,9],"\u002F(k−1)","以上都不是",{"count":11,"courseId":12,"courseImg":13,"courseName":14,"workId":15,"workName":16},38,"3d4aed8e1b4976c518976db7e6d3db17","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8a320aaa629b2bfcb0e96e6feca6d65e.png","数据结构","work_39251259","树和二叉树","如果一棵非空k(k≥2)叉树T中每个非叶子结点都有k个孩子,则称T为正则k叉树.若T的高度为h(单结点的树h=1),则T的结点数最多为",[19,24,33,42,51,60,66,75,84,93],{"answer":20,"createTime":5,"id":6,"options":21,"question":17,"source":22,"type":23},[],[8,8,8,9],"v1",0,{"answer":25,"createTime":5,"id":26,"options":27,"question":32,"source":22,"type":23},[],168468971,[28,29,30,31],"\u002F(k−1)+1","\u002F(k−1)−1","kh","k(h−1)+1","如果一棵非空k(k≥2)叉树T中每个非叶子结点都有k个孩子,则称T为正则k叉树.若T的高度为h(单结点的树h=1),则T的结点数最少为",{"answer":34,"createTime":5,"id":35,"options":36,"question":41,"source":22,"type":23},[],168468972,[37,38,39,40],"10","12","20","21","有一个四叉树,度2的结点数为2,度3的结点数为3,度4的结点数为4.问该树的叶结点个数是多少",{"answer":43,"createTime":5,"id":44,"options":45,"question":50,"source":22,"type":23},[],168468973,[46,47,48,49],"3","4","5","6","按照二叉树的定义,具有3个结点的二叉树有几种",{"answer":52,"createTime":5,"id":53,"options":54,"question":59,"source":22,"type":23},[],168468974,[55,56,57,58],"8","15","16","32","二叉树中第5层(根的层号为1)上的结点个数最多为",{"answer":61,"createTime":5,"id":62,"options":63,"question":65,"source":22,"type":23},[],168468975,[55,37,38,64],"13","三叉树中,度为1的结点有5个,度为2的结点3个,度为3的结点2个,问该树含有几个叶结点",{"answer":67,"createTime":5,"id":68,"options":69,"question":74,"source":22,"type":23},[],168468976,[70,71,72,73],"n在m左方","n在m右方","n是m祖先","n是m子孙","设n、m为一棵二叉树上的两个结点,在中序遍历时,n在m前的条件是",{"answer":76,"createTime":5,"id":77,"options":78,"question":83,"source":22,"type":23},[],168468977,[79,80,81,82],"2h, 2h−1","2h−1, 2h−1","2h−1, 2h−1−1","2h−1+1, 2h−1","设高为h的二叉树(规定叶子结点的高度为1)只有度为0和2的结点,则此类二叉树的最少结点数和最多结点数分别为",{"answer":85,"createTime":5,"id":86,"options":87,"question":92,"source":22,"type":23},[],168468978,[88,89,90,91],"41","82","113","112","在一棵度为4的树T中,若有20个度为4的结点,10个度为3的结点,1个度为2的结点,10个度为1的结点,则树T的叶结点个数是",{"answer":94,"createTime":5,"id":95,"options":96,"question":101,"source":22,"type":23},[],168468979,[97,98,99,100],"c","d","f","g","已知一棵二叉树的树形如下图所示,其后序序列为{ e, a, c, b, d, g, f }.树中与结点a 同层的结点是: \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fc3952417ab2a4f7d34ce2bed3c359905.webp\">"]