Definition
A rooted tree is a Directed Acyclic Graph with a distinguished node called the root such that there is exactly one path from the root to every other node in the graph.
Properties
- Every node except the root has exactly one incoming edge.
- The root has no incoming edges.
- Rooted trees naturally define parent-child relationships between nodes.