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

• A. Directed tree
• B. Undirected tree
• C. Dis-joint tree
• D. Direction oriented tree