HW2: Proving Properties of Binary Trees

Use induction to show each property below.
  1. A full binary tree with n nodes has (n-1)/2 internal nodes and (n+1)/2 leaves.

  2. A proper binary tree always has an odd number of nodes.

  3. Any tree with at least two nodes has at least two nodes of degree 1.