Every binary tree has an odd number of vertices explain it
Answers
Answered by
3
Theorem 4.10 Every binary tree has an odd number of vertices. Proof Apart from the root, every vertex in a binary tree is of odd degree. We know that there are even number of such odd vertices. Therefore when the root (which is of even degree) is added to this number, the total number of vertices is odd.
Similar questions