[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fwlG3vpnPe252iWqecGUi3wzKJk0BJ-WVM84-6xbWZDc":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":16,"related":17,"source":27,"type":28},[],"2026-05-17 12:13:15",374276956,[8,9,10,11],"发生改变","不发生改变","不能确定","以上都不对",{"courseId":13,"courseImg":14,"courseName":15},"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","任何一棵二叉树的叶结点在先序、中序和后序遍历序列中的相对次序( )",[18,29,38,47,52,61,70,79,88,97],{"answer":19,"createTime":5,"id":20,"options":21,"question":26,"source":27,"type":28},[],374276938,[22,23,24,25],"有序数据元素","无序数据元素","元素之间无联系的数据","元素之间具有分支层次关系的数据","树最适合于用来表示( )","v1",0,{"answer":30,"createTime":5,"id":31,"options":32,"question":37,"source":27,"type":28},[],374276940,[33,34,35,36],"nd","n(d−1)","n(d−1)+1","以上都不是","设每个d叉树的结点有d个指针指向子树,有n个结点的d叉树有( )空链域",{"answer":39,"createTime":5,"id":40,"options":41,"question":46,"source":27,"type":28},[],374276942,[42,43,44,45],"空或只有一个结点","高度等于其结点数","任一结点无左孩子","任一结点无右孩子","某二叉树的中序序列和后序序列正好相反,则该二叉树一定是( )",{"answer":48,"createTime":5,"id":49,"options":50,"question":51,"source":27,"type":28},[],374276944,[42,43,44,45],"某二叉树的前序和后序遍历序列正好相反,则该二叉树一定是( )",{"answer":53,"createTime":5,"id":54,"options":55,"question":60,"source":27,"type":28},[],374276946,[56,57,58,59],"ABC","BAC","CBA","CAB","已知一棵二叉树的先序遍历结果是ABC,则以下哪个序列是不可能的中序遍历结果( )",{"answer":62,"createTime":5,"id":63,"options":64,"question":69,"source":27,"type":28},[],374276948,[65,66,67,68],"ABCDEFG","ABDFEGC","ABDFECG","ABDEFCG","如果二叉树的后序遍历结果是FDEBGCA,中序遍历结果是FDBEACG,那么该二叉树的前序遍历结果是( )",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":27,"type":28},[],374276950,[74,75,76,77],"存在一种二叉树结构,其前序遍历结果是…A…B…,而中序遍历结果是…B…A…","存在一种二叉树结构,其中序遍历结果是…A…B…,而后序遍历结果是…B…A…","存在一种二叉树结构,其前序遍历结果是…A…B…,而后序遍历结果是…B…A…","以上三种都是错的","如果A和B都是二叉树的叶结点,那么下面判断中( )是对的",{"answer":80,"createTime":5,"id":81,"options":82,"question":87,"source":27,"type":28},[],374276952,[83,84,85,86],"NRL","RNL","LRN","RLN","给定二叉树如下图所示.设N代表二叉树的根,L代表根结点的左子树,R代表根结点的右子树.若遍历后的结点序列为3、1、7、5、6、2、4,则其遍历方式是( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F2cd0bd195672c899efb98f36be5e58aa.jpg\">",{"answer":89,"createTime":5,"id":90,"options":91,"question":96,"source":27,"type":28},[],374276954,[92,93,94,95],"①④","②④","①②③","②③④","在下述结论中,正确的是:①只有一个结点的二叉树的度为0;②二叉树的度为2;③二叉树的左右子树可任意交换;④深度为K的完全二叉树的结点个数小于或等于深度相同的满二叉树",{"answer":98,"createTime":5,"id":6,"options":99,"question":16,"source":27,"type":28},[],[8,9,10,11]]