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 has the exact same characteristics and, given an n-vertex rooted tree T, it outputs 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 .