Description: To a depth of k over the binary tree (n = 2k-1) as an example, suppose the table to find the probability of each record the same, that is, pi = 1/n (1 ≤ i ≤ n), and the tree layer of the first i There are 2i-1 nodes, therefore, to find half the average length of search as follows: Therefore, to find half the average time complexity is O (log2n).
To Search:
File list (Check if you may need any files):
递归折半查找
............\BinSearch2.cpp
............\BinSearch2Main.cpp
Download