A Near-Linear Area Bound for Drawing Binary Trees

We present several simple methods to construct planar, strictly upward, strongly order-preserving, straight-line drawings of any n-node binary tree. In particular, it is shown that O(n1+) area is always sufficient for an arbitrary constant > 0. Key Words. Graph drawing, Trees.

• Type: Journal
• Year: 2002
• Where: ALGORITHMICA
• Authors: Timothy M. Chan
• Keywords: ALGORITHMICA 2002, N-node Binary Tree, Simple Methods, Straight-line Drawings