A fundamental implementation of the binary tree in Flash. A binary tree is defined as a system of nodes in which each node may or may not contain a left and right child node.   figure a. allthough only a fraction of the nodes in this binary tree have been expanded, it is clear to see the exponentiating growth rate a system like this produces. The binary tree is essentially a structure used to store information. Unlike other tree structures, each node of the binary tree is limited to two child nodes. To give this binary tree a slightly more asthetic appearance, the width in which child nodes are spawned is randomized and is kept small relative to the depth.           jtarbell March 16, 2001