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.
- Graph drawing
ASJC Scopus subject areas
- Computer Science(all)
- Computer Science Applications
- Applied Mathematics