Math, asked by dgill8112, 11 hours ago

Prove that for any non -empty binary tree t if n0 be number of leaves and n1 be the number of nodes of degree 2 then n0=n1+1

Answers

Answered by adityaraj28b
0

follow me please I will follow you if you follow me

Similar questions