every binary tree has an odd number of vertices explain
Answers
Answered by
2
A binary tree has several vertices of which one
is the root vertex. The other vertices are even in number. The root vertex
always has a degree of two and the other even number of vertices have a degree
of either one or three. So, the total number of vertices comprising both the
vertices with odd degrees and the root vertex with an even degree is odd.
Hence, every binary tree has an odd number of vertices.
Similar questions