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