如果按关键码值递增的顺序依次将n个关键码值插入到二叉搜索树中 如果对这样的二叉搜索树进行检索
已帮助 人
如果按关键码值递增的顺序依次将n个关键码值插入到二叉搜索树中,如果对这样的二叉搜索树进行检索时,每次检索的字符都等概率的从这n个关键码值中选取,平均比较次数为多少? If we insert n key values to a binary search tree successively from small to large, when we search this binary search tree, each time the search character is selected from these n key values with the same possibility, then how many times will the comparison be on average?

回答
共1条回复-
(n+1)/2##%_YZPRLFH_%##(1+n)/2
