  We prove a fix point theorem for monoids of self-embeddings of trees. As a
corollary, we obtain a result by Laflamme, Pouzet and Sauer that a tree either
contains a subdivided binary tree as a subtree or has a vertex, and edge, an
end or two ends fixed by all its self-embeddings.
