Algorithmic skeletons are polymorphic higher-order functions that represent common parallelization patterns. In this paper we present a parallel implementation of a skeleton-based dynamic load balancing algorithm for parallel adaptive multigrid solvers. It works on distributed refinement trees that arise during adaptive refinement of grids. Finally, we discuss some properties of the algorithm, for example speed and locality of the distribution.