Figure 3From: A practical O(n log2 n) time algorithm for computing the triplet distance on binary treesColoring algorithm. The five steps of the coloring in the smaller-half trick.Back to article page