Figure 7From: A practical O(n log2 n) time algorithm for computing the triplet distance on binary treesCounting triplets in a C component. The two cases of counting triplets in a C component.Back to article page