Prove that for any nonempty binary tree $,$

T $,$

if no is the number of

leat nodes and n$2$ the number of nodes of degree $2,$

then no $=$ n$2+1.$