If T is a tree having no vertex of degree 2, then T has more leaves than internal nodes.
Prove this claim by a) induction, b) by considering the average degree and using the handshaking lemma.
Get Answers For Free
Most questions answered within 1 hours.