[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fUZhbgjNgWZBMRjYDpnj2nQSayJsfNxi5AOL-UfMWgfE":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",374276942,[8,9,10,11],"空或只有一个结点","高度等于其结点数","任一结点无左孩子","任一结点无右孩子",{"courseId":13,"courseImg":14,"courseName":15},"53e1d2ef4961cca8eea3e23969ad2cb9","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","默认课程","某二叉树的中序序列和后序序列正好相反,则该二叉树一定是( )",[18,29,38,41,46,55,64,73,82,91],{"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":6,"options":40,"question":16,"source":27,"type":28},[],[8,9,10,11],{"answer":42,"createTime":5,"id":43,"options":44,"question":45,"source":27,"type":28},[],374276944,[8,9,10,11],"某二叉树的前序和后序遍历序列正好相反,则该二叉树一定是( )",{"answer":47,"createTime":5,"id":48,"options":49,"question":54,"source":27,"type":28},[],374276946,[50,51,52,53],"ABC","BAC","CBA","CAB","已知一棵二叉树的先序遍历结果是ABC,则以下哪个序列是不可能的中序遍历结果( )",{"answer":56,"createTime":5,"id":57,"options":58,"question":63,"source":27,"type":28},[],374276948,[59,60,61,62],"ABCDEFG","ABDFEGC","ABDFECG","ABDEFCG","如果二叉树的后序遍历结果是FDEBGCA,中序遍历结果是FDBEACG,那么该二叉树的前序遍历结果是( )",{"answer":65,"createTime":5,"id":66,"options":67,"question":72,"source":27,"type":28},[],374276950,[68,69,70,71],"存在一种二叉树结构,其前序遍历结果是…A…B…,而中序遍历结果是…B…A…","存在一种二叉树结构,其中序遍历结果是…A…B…,而后序遍历结果是…B…A…","存在一种二叉树结构,其前序遍历结果是…A…B…,而后序遍历结果是…B…A…","以上三种都是错的","如果A和B都是二叉树的叶结点,那么下面判断中( )是对的",{"answer":74,"createTime":5,"id":75,"options":76,"question":81,"source":27,"type":28},[],374276952,[77,78,79,80],"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":83,"createTime":5,"id":84,"options":85,"question":90,"source":27,"type":28},[],374276954,[86,87,88,89],"①④","②④","①②③","②③④","在下述结论中,正确的是:①只有一个结点的二叉树的度为0;②二叉树的度为2;③二叉树的左右子树可任意交换;④深度为K的完全二叉树的结点个数小于或等于深度相同的满二叉树",{"answer":92,"createTime":5,"id":93,"options":94,"question":99,"source":27,"type":28},[],374276956,[95,96,97,98],"发生改变","不发生改变","不能确定","以上都不对","任何一棵二叉树的叶结点在先序、中序和后序遍历序列中的相对次序( )"]