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

M

Mr. Dubey

🎓 Coach ⭐ 104.60K Points

📊 Data Structure (DS)

Q. 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

💬 Discuss

✅ Correct Answer: (A) directed tree

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

267

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

88%

Success Rate