Which of the following statement is correct?
P1: Every tree will always be a graph
P2: Every graph will always be trees.
P3: Every tree will be a graph, but every graph will not be a tree
P4: Every graph will be a tree, but every tree will not be a graph.
(A)
P1 and P2
(B)
P1
(C)
P2
(D)
P1 and P3
Answer: (D)
Explanation:
Trees are the restricted types of graphs, just with some more rules. Every tree will always be a graph but not all graphs will be trees. Linked List, Trees, and Heaps all are special cases of graphs.
Hence Option(D) is the correct answer.
Quiz of this Question
Please comment below if you find anything wrong in the above post
Article Tags :
Uncategorized
Recommended Articles