recategorized by
452 views
2 votes
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$

recategorized by

1 Answer

2 votes
2 votes
They are asking about any kind of tree.Not necessarily Binary.Question is about minimum vertices of degree 1(pendant vertices)

in Any tree ,there will be at least 2 Pendant vertices(as per theorem)

so 2 should be the answer

Related questions

4 votes
4 votes
1 answer
1
2 votes
2 votes
3 answers
2
learncp asked Jan 26, 2016
747 views
Insert the given values in the order in initially empty $\text{AVL}$ tree.$\text{34,21,10,27,24,43,15,6}$What is the value at the root of the tree$?$
1 votes
1 votes
2 answers
3
smartmeet asked Jan 18, 2017
1,003 views
What we can do if the unary operator comes in infix notation while converting it into postfix/prefix notations? For example, this $a = -b+c*d/e+f↑g↑h-i*j$