A multiple binary-tree network has n inputs and n outputs, where n is a power of 2. Each input is connected to the root of a binary tree with n/2 leaves and with edges pointing away from the root. Likewise, each output is connected to the root of a binary tree with n/2 leaves and with edges pointing toward the root. 2 Two edges point from each leaf of an input tree, and each of these edges points to a leaf of an output tree. The matching of leaf edges is arranged so that for every input and output tree, there is an edge from a leaf of the input tree to a leaf of the output tree, and every output tree leaf has exactly two edges pointing to it.

Draw such a multiple binary-tree net for n = 4.