算法导论6.1-2习题解答

CLRS 6.1-2 :

证明：含n个元素的堆的高度为[lgn].

证明：因为 2^h <= n <= 2^(h+1) - 1

         所以 lg(n+1) -1 <= h<= lg(n)

         可推出lg(n) - 1 < lg(n+1) -1 <= h<= lg(n)

         从而h = [lgn].

转载于:https://www.cnblogs.com/null00/archive/2011/03/20/2065082.html