Math, asked by sp784413, 4 months ago

the total number of vertices in a binary tree is n, then prove that the number of internal vertices in it is (n-1) /2​

Answers

Answered by sufiyamodi01
0

Answer:

1jeghsbejhsvwiwbhehevdhhd

Similar questions