A directed graph is said to be a tree if it is acyclic and every vertex except the root has exactly one incoming edge.