We characterize trees, given a size and maximum vertex degree, which have the greatest number of subtrees. This generalizes the recent result of Szekely and Wang. These trees coincide with those which were shown by Fischermann et al., and independently Jelen and Triesch, to minimize the Wiener index.