Before revision:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
After revision:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing of T that fits on a n \times n grid. For unrooted ordered trees, we present an algorithms that produces monotone drawings that respect the ordering and fit in an (n+1) \times (\frac{n size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .