A

Admin • 833.24K Points
Coach

Q. 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

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.