They are asking about minimum vertices.

For minimum vertices having degree 2.

For minimum vertices having degree 2.

The Gateway to Computer Science Excellence

+2 votes

The minimum number of vertices having degree $1$ in a tree of at least $10$ vertices is ______________.

If we consider this question, then the first answer comes in our mind is $'2',$ right?

But what if Tree isn't binary?

if the root node has $9$ leaf nodes, so all those nodes having degree $1,$ right$?$ So the answer could be$**:**9$

52,218 questions

59,895 answers

201,086 comments

118,135 users