(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.)