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