+1 vote
in Data Structures & Algorithms I by (88.2k points)
All trees with n vertices consists of n-1 edges.

(a) True

(b) False

My question is taken from Undirected Graph in division Graph of Data Structures & Algorithms I

I had been asked this question in an internship interview.

1 Answer

+1 vote
by (737k points)
selected by
 
Best answer
Right choice is (a) True

To explain: A trees is acyclic in nature.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...