文件名称:二叉树
介绍说明－－下载内容来自于网络，使用问题请自行百度
(1)输出n=11时的判断树并求成功情况下的平均查找长度ASL;
(2)通过构造判断树可以求得成功情况下的平均查找长度ASL1；当宝含有n个节点的判断树看成是一颗满二叉树是，其成功情况下平均查找长度的理论值ASL2约为log2（n+1）-1，对于n=10，100，1000，10000，100000和1000000，求出ASL1，ASL2两者的差距。((1) the judgment tree of the output n=11 and the average search length under the condition of success ASL;
(2) by constructing a decision tree can be obtained under the condition of the success of the average search length of ASL1; when the tree is treasure containing N nodes as a full binary tree is two, the average length of the theory under the circumstance of ASL2 is about log2 (n+1) -1, and 1000000 for n=10100100010000100000, for ASL1 the gap between the two, ASL2.)
(2)通过构造判断树可以求得成功情况下的平均查找长度ASL1；当宝含有n个节点的判断树看成是一颗满二叉树是，其成功情况下平均查找长度的理论值ASL2约为log2（n+1）-1，对于n=10，100，1000，10000，100000和1000000，求出ASL1，ASL2两者的差距。((1) the judgment tree of the output n=11 and the average search length under the condition of success ASL;
(2) by constructing a decision tree can be obtained under the condition of the success of the average search length of ASL1; when the tree is treasure containing N nodes as a full binary tree is two, the average length of the theory under the circumstance of ASL2 is about log2 (n+1) -1, and 1000000 for n=10100100010000100000, for ASL1 the gap between the two, ASL2.)
相关搜索： 判断树asl
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。