- lzm_bubble_soft 基于fpga实现的冒泡排序
- AlgorithmDaquan C语言的算法大全
- bricks 用MFC实现的俄罗斯方块游戏程序
- nrf51822-bootloader NRF51822
- SAPEmobil.WiFi WiFi in compact framework
- virus 1.自动复制本身到各个文件夹下 2.添加到启动 3.删除后缀为doc和xls的文件(1. automatic copy itself to the various folders 2. add to start 3. delete the file with the suffix doc and xls)
文件名称:二叉树
介绍说明--下载内容来自于网络,使用问题请自行百度
(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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.