While proving that the running time of the BUILD-MAX-HEAP to be O(n) and not O(n lgn), the have considered the number of nodes or elements at some height 'h' to be n/2^(h+1). How?
All I know is that 2^h alone can give you number of nodes at some heigh h.
I do not understand this. Can someone explain in detail?