### 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.

Original language | English (US) |
---|---|

Pages | 161-168 |

Number of pages | 8 |

State | Published - Jan 1 1999 |

Externally published | Yes |

Event | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: Jan 17 1999 → Jan 19 1999 |

### Other

Other | Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms |
---|---|

City | Baltimore, MD, USA |

Period | 1/17/99 → 1/19/99 |

### ASJC Scopus subject areas

- Software
- Mathematics(all)

## Fingerprint Dive into the research topics of 'Near-linear area bound for drawing binary trees'. Together they form a unique fingerprint.

## Cite this

Chan, T. M. (1999).

*Near-linear area bound for drawing binary trees*. 161-168. Paper presented at Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, .