The Gateway to Computer Science Excellence
+2 votes
184 views

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$

in DS by Active (4.8k points)
recategorized by | 184 views
+1
They are asking about minimum vertices.

For minimum vertices having degree 2.
0
question is asking for min vertices it is not mentioned which type of tree u considering. take example which have min vertex of degree 1.

so 2 is correct ans. and tree shape is linear or uniary tree.

1 Answer

+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
by Boss (17.9k points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,157 answers
193,763 comments
93,734 users