Q. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1. (Solved)

1. directed tree

2. undirected tree

3. dis-joint tree