Let $T$ be a tree on $n$ vertices and let $L_q^T$ be the $q$-analogue of its Laplacian. For a partition $λ\vdash n$, let the normalized immanant of $L_q^T$ indexed by $λ$ be denoted as $d_λ(L_q^T)$. A string of inequalities among $d_λ(L_q^T)$ is known when $λ$ varies over hook partitions of $n$ as the size of the first part of $λ$ decreases. In this work, we show a similar sequence of inequalities when $λ$ varies over two row partitions of $n$ as the size of the first part of $λ$ decreases. Our main lemma is an identity involving binomial coefficients and irreducible character values of $S_n$ indexed by two row partitions. Our proof can be interpreted using the combinatorics of Riordan paths and our main lemma admits a nice probabilisitic interpretation involving peaks at odd heights in generalized Dyck paths or equivalently involving special descents in Standard Young Tableaux with two rows. As a corollary, we also get inequalities between $d_{λ_1}(L_q^{T_1})$ and $d_{λ_2}(L_q^{T_2})$ when $T_1$ and $T_2$ are comparable trees in the $GTS_n$ poset and when $λ_1$ and $λ_2$ are both two rowed partitions of $n$, with $λ_1$ having a larger first part than $λ_2$.