In set theory, a tree is a partially ordered set such that for each , the set is well-ordered by the relation . Frequently trees are assumed to have only one root (i.e. minimal element), as the typical questions investigated in this field are easily reduced to questions about single-rooted trees.

Definition

A tree is a partially ordered set

3.Next