Data Structure (DS) MCQ: A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

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

Correct Answer: directed tree

Make the most of this question

This page focuses on one Data Structure (DS) question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Data Structure (DS) MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Data Structure (DS) MCQ: A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1. | Extra Education