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

Question 1

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

Question 2

a) directed tree

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

Please log in or register to answer this question.

1 Answer