A tree can be a very different thing in different parts of mathematics. It might be a certain kind of acyclic graph; or a partial order such that the predecessors of every node are linearly ordered; or a partial order where the predecessors are well-ordered; or either of these, except with successors instead of predecessors. In some parts of mathematics, trees are presumed finite, while in others, they are nontrivial only when infinite.
