Tree at Last
lA tree is a directed graph such that:
l
lThe graph is acyclic.
l
lThere is exactly one root.
l
lIt has no fan-in.