A___is an acyclic digraph, which has the only node with in-degree 0, and other nodes have indegree I.
A
Dis-joint tree
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Direction oriented tree
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
Directed tree
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
Diagonalised tree
No worries! We‘ve got your back. Try BYJU‘S free classes today!
E
Undirected tree
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution
The correct option is C Directed tree A directed trees is an acyclic digraph, which has only one node with indegree 0, and others nodes have indegree I.