We study the area requirements for strictly-upward straight-line grid
drawings of complete and Fibonacci trees. We prove that a complete tre
e with n nodes can be drawn in n + O(log n root n) area, and a Fibonac
ci tree with n nodes can be drawn in 1.17n + O(log n root n) area.