Prove that in binary tree no. Of leaves is equal to no of nodes of two children +1
Answers
Answered by
0
Answer:
Use handshaking lemma or otherwise sum of degrees of vertex theorem
Explanation:
Similar questions