[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fcIeUYEax-0jzF6Lt7ilOaweZi3D9TrEkd0c-Y7YogbU":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2024-11-27 13:05:32",167691459,[8,9,10,11],"有序数据元素","无序数据元素","元素之间无联系的数据","元素之间有分支的层次关系",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},40,"085d5c83b566c80cbca76675010da889","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8f106bf477ae8c8d59767d3e20fea3cc.png","23电子信息工程数据结构","work_39320957","Ch19 热力学循环 测试题","树最适合用来表示 _______",[21,26,35,44,53,62,71,77,86,92],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":34,"source":24,"type":25},[],167691460,[30,31,32,33],"互不相交","可以相交","叶结点可以相交","树枝结点可以相交","在树中除根结点外,其余结点分成m(m≥0)个 _______的集合T1,T2,T3...Tm,每个集合又都是树,此时结点T称为Ti的父结点,Ti称为T的子结点(1≤i≤m)",{"answer":36,"createTime":5,"id":37,"options":38,"question":43,"source":24,"type":25},[],167691461,[39,40,41,42],"双亲表示法","孩子链表表示法","顺序存储表示法","孩子兄弟表示法","在下列存储形式中, _______不是树的存储形式",{"answer":45,"createTime":5,"id":46,"options":47,"question":52,"source":24,"type":25},[],167691462,[48,49,50,51],"队列","栈","线性表","二叉树","以下数据结构中属于非线性结构的是 _______",{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":24,"type":25},[],167691463,[57,58,59,60],"4","5","6","7","根据二叉树的定义可知,二叉树共有 _______种不同的形态",{"answer":63,"createTime":5,"id":64,"options":65,"question":70,"source":24,"type":25},[],167691464,[66,67,68,69],"二叉树是度为2的有序树","二叉树中结点只有一个孩子时无左右之分","二叉树中必有度为2的结点","二叉树中最多只有两棵子树,且有左右子树之分","下列陈述正确的是 _______",{"answer":72,"createTime":5,"id":73,"options":74,"question":76,"source":24,"type":25},[],167691465,[75,57,58,59],"3","按照二叉树的定义,具有3个结点的二叉树有 _______种不同形态",{"answer":78,"createTime":5,"id":79,"options":80,"question":85,"source":24,"type":25},[],167691466,[81,82,83,84],"2i","2i+1","2i-1","不存在","具有n(n>1)个结点的完全二叉树中,结点i(2i+1>n)的左孩子结点是 _______",{"answer":87,"createTime":5,"id":88,"options":89,"question":91,"source":24,"type":25},[],167691467,[81,82,90,83],"i\u002F2","设按照从上到下、从左到右的顺序从1开始对完全二叉树进行顺序编号,则编号为i结点的右孩子结点(假设存在)的编号为 _______",{"answer":93,"createTime":5,"id":94,"options":95,"question":100,"source":24,"type":25},[],167691468,[96,97,98,99],"250","500","254","501","一棵完全二叉树上有1001个结点,其中叶子结点的个数是 _______"]