  We classify the trees on $n$ vertices with the maximum and the minimum number
of certain generalized colorings, including conflict-free, odd,
non-monochromatic, star, and star rainbow vertex colorings. We also extend a
result of Cutler and Radcliffe on the maximum and minimum number of existence
homomorphisms from a tree to a completely looped graph on $q$ vertices.
