Binary trees: Let T denote proper binary tree of height h having n nodes. Formally establish that the number of internal nodes in T is at least h and at most n^h-1.