A Near‐Linear Area Bound for Drawing Binary Trees

A Near‐Linear Area Bound for Drawing Binary Trees

0.00 Avg rating0 Votes
Article ID: iaor20121113
Volume: 34
Issue: 1
Start Page Number: 1
End Page Number: 13
Publication Date: Sep 2002
Journal: Algorithmica
Authors:
Keywords: graphical methods, 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(n1+ϵ) area is always sufficient for an arbitrary constant ϵ>0 .

Reviews

Required fields are marked *. Your email address will not be published.