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

Related MCQs

• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
• A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as
• What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?