2. Prove that for any non-empty binary true T, if is the number of leaves and be the number of nodes having degree 2, then .
2. Prove that for any non-empty binary true T, if is the number of leaves and be the number of nodes having degree 2, then .
Share