Which property distinguishes a rooted tree from a general directed graph?

Which property distinguishes a rooted tree from a general directed graph?

1. Every non-root node has exactly one parent, and every node is reachable from the root.
2. Every node has at least two outgoing edges.
3. Every edge carries the same numeric weight.
4. Every node is stored in an adjacency matrix.