The {ı irregularity\/} of a graph $G$ is defined as $irr(G) =\sum |d(x)-d(y)|$ where $d(x)$ is the degree of vertex $x$ and the summation embraces all pairs of adjacent vertices of $G$. We characterize the trees with the five smallest and five largest $irr$-values.