Question: A binary tree is a full binary tree if each vertex has either two nonempty children or two empty children (a vertex with two empty children is called a leaf.) Are there any full binary trees on an even number of vertices? Prove that what you say is correct.