L. Trevisan.<br>
<b>A Note on Minimum-Area 
Upward Drawing of Complete and Fibonacci Trees.</b><br>
<i>Information Processing Letters</i>, <b>57</b>(5):231-236, 1996.<br>

<dl>


<dt> <b> Abstract </b> <dd> We study the area requirement for
upward straight-line 
grid drawing of complete and 
Fibonacci tree. We prove that a complete tree with 
n nodes can be drawn in n + o(n) area,
and a Fibonacci tree with n nodes can be drawn in 1.17n +  o(n)
area.
</dl>