Definition: The height of a non$-$empty tree is defined as the number of nodes on the longest path from a leaf of a tree to its root; the height of an empty tree is defined to be $0.$

Nodes in a Binary Tree: Suppose a binary tree T has height h$.$ Prove that T contains at least h nodes and at most $2$h $-1$ nodes.