Trees with a given number of leaves and the maximal number of maximum independent sets

A complete description of trees with maximal possible number of maximum independent sets among all $n$-vertex trees with exactly $l$ leaves is obtained. For all values of the parameters $n$ and $l$ the extremal tree is unique and is the result of merging the endpoints of $l$ simple paths.