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

  1. Home

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

1. directed tree

2.undirected tree

3.dis-joint tree

4.direction oriented tree

Posted by R4R Team
  1. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!