  Seo and Shin showed that the number of rooted trees on $[n+1]$ such that the
maximal decreasing subtree with the same root has $k+1$ vertices is equal to
the number of functions $f:[n]\to[n]$ such that the image of $f$ contains
$[k]$. We give a bijective proof of this theorem.
