We show that the maximum number of minimum dominating sets of a forest with domination number $γ$ is at most $\sqrt{5}^γ$ and construct for each $γ$ a tree with domination number $γ$ that has more than $\frac{2}{5}\sqrt{5}^γ$ minimum dominating sets. Furthermore, we disprove a conjecture about the number of minimum total dominating sets in forests by Henning, Mohr and Rautenbach.