Let T be a binary tree with height h and n nodes. Show that log(n 1)-1ShS (n-1)/2. For which values of n and h can the above lower and upper bounds onh be attained with equality