  Let $T$ be a tree, a vertex of degree one is called a leaf. The set of leaves
of $T$ is denoted by $Leaf(T)$. The subtree $T-Leaf(T)$ of $T$ is called the
stem of $T$ and denoted by $Stem(T).$ In this note, we give a sharp sufficient
condition to show that a $K_{1,t}-$free graph has a spanning tree whose stem
has a few leaves. By applying the main result, we give improvements of previous
related results.
