Which of the following represents a cyclic directed graph with a node having in-degree zero, while all others have an in-degree of one?

Correct option is C

A Directed Tree is a type of directed acyclic graph (DAG) where there is a single root node with an in-degree of zero, and every other node has exactly one parent (in-degree of one). This structure ensures hierarchical relationships without forming cycles.
Important Key Points:
1. In-degree: The number of incoming edges to a node in a graph.
2. Directed Tree: A special case of a graph where nodes are connected hierarchically without cycles.
3. Binary Tree: A type of tree where each node has at most two children, not necessarily directed.
Knowledge Booster:
· Hash Trees: Used in cryptographic applications like blockchain (e.g., Merkle Trees).
· B-Trees: Self-balancing search trees for database indexing.
· R-Trees: Used for spatial data indexing (e.g., maps).