Scaleability of a Binary Tree on a Hypercube

The concept of scalability is extended to a twin-tree structure composed of two n-1 level binary trees connected via a third link between the roots of the trees. The addendum contains a proof of the fact that the twin-tree structure is scalable on a hypercube.