Tree at Last
lA tree is a directed graph such that:

lThe graph is acyclic.

lThere is exactly one root.

lIt has no fan-in.