Extremal results on the Mostar index of trees with fixed parameters

For a graph $G$, the Mostar index of $G$ is the sum of $\mathrm{\mid }{n}_u(e)$ - $n_v(e)\mathrm{\mid }$ over all edges $e=uv$ of $G$, where $n_u(e)$ denotes the number of vertices of $G$ that have a smaller distance in $G$ to $u$ than to $v$, and analogously for $n_v(e)$. We determine all the graphs that maximize and minimize the Mostar index respectively over all trees in terms of some fixed parameters like the number of odd vertices, the number of vertices of degree two, and the number of pendent paths of fixed length.