COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
A graph is also a tree.
|
|
|
A tree can have both directed and undirected edges.
|
|
|
A tree can have a connection between two child nodes.
|
|
|
A tree is a special case of a connected graph with only undirected edges and no cycles.
|
Detailed explanation-1: -(C) A connected subgraph of a connected graph is a tree if there exist many paths between any pair of nodes in it.
Detailed explanation-2: -A tree is a connected subgraph of a connected graph containing all the nodes of the graph but containing no loops, i.e., there is a unique path between every pair of nodes. The number of closed paths in a tree of the graph is zero.
Detailed explanation-3: -Tree is a special kind of graph that has no cycle so that is known as DAG (Directed Acyclic Graph). Tree is a hierarchical model. In graph, each node has one or more predecessor nodes and successor nodes.
Detailed explanation-4: -Definition: A tree is a connected graph without any cycles, or a tree is a connected acyclic graph. The edges of a tree are called branches. It follows immediately from the definition that a tree has to be a simple graph (because self-loops and parallel edges both form cycles).