I am trying to make a proof by induction of the following theorem.
If T is a full binary tree with i internal vertices, then T has i + 1 terminal vertices and 2i + 1 total vertices.
I have done this so far but I am just starting to understand proofs and am stuck about what to do next.
Base Case: P(1): 1 internal vertex => 1+1 = 2 terminal vertices Induction: Assume true: P(n): n internal vertices => n+1 terminal vertices Show true: P(n+1): n+1 internal vertices => (n+1)+1 = n+2 terminal vertices
After this I am unsure of how to proceed.