A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Trees are usually drawn planar, i.e. without any edge-crossings. In this paper, we investigate the area requirement of (non-upward) planar straight-line grid drawings of binary trees. Let T be a binary tree with n nodes. We show that T admits a planar straight-line grid drawing with area O(n) and with any pre-specified aspect ratio in the range [n − , n ], where is any constant, such that 0 < < 1. We also show that such a drawing can be constructed in O(n log n) time. In particular, our resultdoi:10.7155/jgaa.00086 fatcat:opeu3iomrnhzpfbnqkgdot3gwm