Question

the degree of one vertex in a bindary tree is exactly​

Answer 1

Answer:

In a full binary tree, only one vertex, namely, the root is of even degree (namely 2) and each of the other (n-1) vertices is of odd degree (namely 1 or 3.) Since the number of vertices of odd degree in an undirected graph is given even, (n-1) is even.

Step-by-step explanation:

hope the answer is helpful to you