The first multiplicative Zagreb index $Π_1$ of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index $Π_2$ is the product of the products of degrees of pairs of adjacent vertices. In this paper, we give sharp lower bound for $Π_1$ and upper bound for $Π_2$ of trees with given distance $k$-domination number, and characterize those trees attaining the bounds.