Use structural induction to prove that the number of nodes in a complete (non-empty) binary tree of height h is 2^h+1-1. Remember that a complete tree is where every layer is full.

NOTE: Simply summing up the size of each layer is a direct proof, not inductive. Instead, you must break a large tree down into one or more smaller trees