0 votes
in Data Structures & Algorithms by
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

1 Answer

0 votes
by
a) directed tree

Related questions

0 votes
asked Jan 14, 2020 in QuickTest Professional (QTP) by GeorgeBell
+1 vote
asked Oct 23, 2021 in Artificial Intelligence by DavidAnderson
...