Helps for counting and enumerating the trees on a terrace. SUPERB is an algorithm that takes a set of rooted binary trees and then construct, when is it possible, all rooted, binary so-called supertrees that are compatible with all given trees in the input tree set. The algorithm starts with all leaves/taxa. Then, for each leaf, it determines if it belongs to the left or right subtree of the root. In the recursion, the algorithm then again divides the leaves among the children of the next node.