Up until now, we have been organizing data in a "linear" fashion: one item after another. The corresponding data structures are the immutable scheme list (IList) and the mutable linear recursive structure (LRStruct). Now, suppose we want to model something like the following organization chart.
A structure of data such as the above is called a tree. We first design a special kind of mutable tree structure called binary trees.