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
Answer» B. undirected tree


Discussion

No Comment Found

Related MCQs