  Motivated by the properties of the descent polynomials, which enumerate
permutations of $S_n$ with a fixed descent set, we define descent polynomials
for labeled rooted trees. We give recursive and explicit formulas for these
polynomials and show when known properties of the descent polynomials carry
over to the setting of trees.
