Trees without twin-leaves with smallest number of maximal independent sets

For any $n$, in the set of $n$-vertex trees such that any two leaves have no common adjacent vertex, we describe the trees with the smallest number of maximal independent sets.