Question

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

Answer 1

a) directed tree