- Category:
- Data structs
- Tags:
-
- File Size:
- 19kb
- Update:
- 2017-07-06
- Downloads:
- 0 Times
- Uploaded by:
- 邓珂可
Description: (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.
To Search:
File list (Check if you may need any files):
Download