I present the first O(n) algorithm for producing tidy drawings of trees with arbitrarily sized nodes (see picture). I first describe this algorithm, then proof that it has an asymptotic complexity of O(n) and finally present a performance comparison with similar algorithms.