edited by
636 views
–4 votes
–4 votes

*MSQ*

The following figure depicts a 

a. A tree and only tree

b. A tree with 3 nodes

c. A graph (Since every tree is a graph)

d. A graph and only graph

 

 

edited by

2 Answers

Best answer
0 votes
0 votes

$options$ $A$, $B$ $And$ $C$ $are$ $correct.$

$A )$  it’s a tree and every tree  is a graph implicitly so a graph also.

$B)$  Yes, it contains $3$ nodes

$C)$  Every tree is a graph.

$D)$  Not just any graph , its a tree.

selected by
0 votes
0 votes
Ans (B) and (C)

A tree is a minimal connected and maximally acyclic graph

Yes, It’s a trivial and stupid question, but helps eliminating GATE MSQ answers in many cases
reshown by

Related questions

0 votes
0 votes
2 answers
1
sripo asked Dec 25, 2018
4,784 views
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
9 votes
9 votes
5 answers
2
target2017 asked Jan 7, 2017
3,061 views
How it is 24? I'm not getting it.
0 votes
0 votes
1 answer
3
once_2019 asked Jun 24, 2018
630 views
Is the root node an internal node?
1 votes
1 votes
1 answer
4
rahul sharma 5 asked Apr 12, 2018
695 views
a:) If given Tree is BST = Inorder of keys is sortedb:) Inorder of keys is sorted = Tree is BST(converse of above)I know first one holds.Is second one also true?If not ca...