
5.7. ALGORITHMS FOR DRAWING BINARY TREES 175
Let n be the number of nodes in T . Let 2 ≤ A ≤ n be any number given as a parameter
to the algorithm.
Figure 5.16 shows the drawing of the tree of Figure 5.13(a) constructed by algorithm
Arbitrary Spine with A =
√
n, using Lemma 5.1.
Figure 5.16 Drawing of the tree with n = 57 nodes of Figure 5.13(a) constructed by the
Algorithm Arbitrary Spine with A =
√
n =
√
57 = 7.55, using Lemma 5.1.
In each recursive step, the algorithm constru c ts a feasible drawing of a subtree T
′
of T . If
T
′
has at most A nodes in it, then it constructs a left-corner drawing of T
′
using Lemma 5.1
such that the drawing has width at most ...