We characterize those subsets of N that are saturated numerical
semigroups. We introduce the concept of SAT system of generators
for a saturated numerical semigroup, and this will enable us to
arrange the set of all saturated numerical semigroups in a binary tree
with no leaves.