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
0
follow me please I will follow you if you follow me
Similar questions
India Languages,
6 hours ago
Social Sciences,
6 hours ago
Geography,
6 hours ago
Physics,
11 hours ago
English,
11 hours ago
Social Sciences,
8 months ago
Physics,
8 months ago
Math,
8 months ago