[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fKUKIisaHLBshpN1nikhsLQL14hDEHABOvzTqeh5eRwk":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-04-30 09:17:53",185326223,[8,9,10,11],"acbed","decab","deabc","cedba",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},18,"d9139572bd8e9b466b5947011e5c5c3f","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F9f919e91c3941b64f778d058a7fcb4c7.jpg","数据结构（C语言）","work_43179486","中国特色社会主义的法治道路(二)","已知某二叉树的后序遍历序列是dabec, 中序遍历序列是debac , 它的前序遍历是( )",[21,32,35,45,54,63,68,77,86,95],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],185326222,[25,26,27,28],"CBEFDA","FEDCBA","CBEDFA","不定","已知一棵二叉树的前序遍历结果为ABCDEF,中序遍历结果为CBAEDF,则后序遍历的结果为( )","v1",0,{"answer":33,"createTime":5,"id":6,"options":34,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":36,"createTime":37,"id":38,"options":39,"question":44,"source":30,"type":31},[],"2025-04-30 09:17:54",185326224,[40,41,42,43],"都不相同","完全相同","先序和中序相同,而与后序不同","中序和后序相同,而与先序不同","在二叉树结点的先序序列,中序序列和后序序列中,所有叶子结点的先后顺序( )",{"answer":46,"createTime":37,"id":47,"options":48,"question":53,"source":30,"type":31},[],185326225,[49,50,51,52],"加快查找结点的前驱或后继的速度","为了能在二叉树中方便的进行插入与删除","为了能方便的找到双亲","使二叉树的遍历结果唯一","引入二叉线索树的目的是( )",{"answer":55,"createTime":37,"id":56,"options":57,"question":62,"source":30,"type":31},[],185326226,[58,59,60,61],"所有的结点均无左孩子","所有的结点均无右孩子","只有一个叶子结点","是任意一棵二叉树","一棵非空的二叉树的先序遍历序列与后序遍历序列正好相反,则该二叉树一定满足( )",{"answer":64,"createTime":37,"id":65,"options":66,"question":53,"source":30,"type":31},[],185326227,[49,67,51,52],"为了能在二叉树中方便地进行插入与删除",{"answer":69,"createTime":37,"id":70,"options":71,"question":76,"source":30,"type":31},[],185326228,[72,73,74,75],"X的双亲","X的右子树中最左的结点","X的左子树中最右结点","X的左子树中最右叶子结点","若X是二叉中序线索树中一个有左孩子的结点,且X不为根,则X的前驱为( )",{"answer":78,"createTime":37,"id":79,"options":80,"question":85,"source":30,"type":31},[],185326229,[81,82,83,84],"LRN","NRL","RLN","RNL","给定二叉树如图所示.设N代表二叉树的根,L代表根结点的左子树,R代表根结点的右子树.若遍历后的结点序列为3,1,7,5,6,2,4,则其遍历方式是( ).\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F8dc28436aca6fb7fd55d33d650ddd0b3.png\">",{"answer":87,"createTime":37,"id":88,"options":89,"question":94,"source":30,"type":31},[],185326230,[90,91,92,93],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F6d669df9a02c79705e2b1d6ac39c4f0a.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fa5172983f1ad02119109bbd7df08f8df.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1b8429d359bf85f2df8ba0021eec9b32.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0f97af03b82454ef5631e95e84a657fc.png\">","对于如图所示的线索二树(用虚线表示线索),符合后序线索树定义的是( )",{"answer":96,"createTime":37,"id":97,"options":98,"question":103,"source":30,"type":31},[],185326231,[99,100,101,102],"1,2,3,4","2,3,4,1","3,2,4,1","4,3,2,1","若一棵二叉树的前序遍历序列和后序遍历序列分别为1,2,3,4和4,3,2,1,则该二叉树的中序遍历序列不会是( )"]