Figures & data
Figure 1. A triplet; the simplest form of binary sub-tree.
Figure 2. A complete binary tree having eight leaf nodes.
Figure 3. The implementation of a virtual node. Node A is a leaf of one sub-tree and B is the root of another sub-tree. A and B both connect with a CBN that is represented by a diamond shape.
Figure 4. A complete binary tree whose internal nodes (X and Y) are shown in their ‘virtual’ form.
Figure 5. The virtual internal nodes of are here replaced by their ‘implemented versions’. That is, each of X and Y from would actually be a set of three nodes involving a CBN with linkage.
Figure 6. Displayed here is the result of removing the leftmost sub-tree of .
Figure 7. Role nodes are shown as white circles. Filler nodes are shaded circles. The black diamond-shaped nodes are CBNs. Only four of the 16 CBNs are displayed here.
