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:  All monotone tree drawing algorithms that have appeared in the literature consider rooted ordered trees and they draw them so that (i) the root of the tree is drawn at the origin of the drawing, (ii) the drawing is confined in the first quadrant, and (iii) the ordering/embedding of the tree is respected. 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 .