[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fkTZNsbF5IPc25uRLU7ysQGZIJBSJm0wQ-RNdYG9tka0":3},{"id":4,"source":5,"question":6,"options":7,"answer":12,"related":13,"type":18,"origin":30,"createTime":20},143840008,"v1","以下说法错误的是( )",[8,9,10,11],"哈夫曼树是带权路径长度最短的树,路径上权值较大的结点离根较近","若一个二叉树的树叶是某子树的中序遍历序列中的第一个结点,则它必是该子树的后序遍历序列中的第一个结点","已知二叉树的前序遍历和后序遍历序列并不能惟一地确定这棵树,因为不知道树的根结点是哪一个","在前序遍历二叉树的序列中,任何结点的子树的所有结点都是直接跟在该结点的之后",[],[14,21],{"id":4,"source":5,"question":6,"options":15,"answer":16,"related":17,"type":18,"origin":19,"createTime":20},[8,9,10,11],[],[],0,null,"2024-05-15T21:22:32+08:00",{"id":22,"source":5,"question":6,"options":23,"answer":28,"related":29,"type":18,"origin":19,"createTime":20},143840009,[24,25,26,27],"一般在哈夫曼树中,权值越大的叶子离根结点越近","哈夫曼树中没有度数为1的分支结点","若初始森林中共有n棵二叉树,最终求得的哈夫曼树共有2n-1个结点","若初始森林中共有n棵二叉树,进行2n-1次合并后才能剩下一棵最终的哈夫曼树",[],[],{"courseName":31,"courseImg":32,"workName":33,"workId":34,"count":35,"courseId":36},"数据结构","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F03a579384a6dc297c89809b582fcc767.png","","work_34912461",2,"19097e4e75bd00dec2526cef9ab584d2"]