A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have indegree 1.
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree
A) Directed tree
B) Undirected tree
C) Dis-joint tree
D) Direction oriented tree