A Near-Linear Area Bound for Drawing Binary Trees

Abstract

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(n^1+ɛ) area is always sufficient for an arbitrary constant ɛ>0 .

Similar content being viewed by others

Improved Upper and Lower Bounds for LR Drawings of Binary Trees

Chapter © 2020

Tree Drawings Revisited

Article 05 June 2019

Drawing Partial 2-Trees with Few Slopes

Article 27 November 2022

Author information

Authors and Affiliations

1. Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1. tmchan@math.uwaterloo.ca., CA

   Chan

Authors

1. Chan
   View author publications

   You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chan A Near-Linear Area Bound for Drawing Binary Trees . Algorithmica 34, 1–13 (2002). https://doi.org/10.1007/s00453-002-0937-x

Download citation

• Issue Date: September 2002

• DOI: https://doi.org/10.1007/s00453-002-0937-x

• Key words. Graph drawing, Trees.