Define the degree of a node as the number of its non-empty children. Prove by induction that

Question:

Define the degree of a node as the number of its non-empty children. Prove by induction that the number of degree 2 nodes in any binary tree is one less than the number of leaves.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: