Enviar Registro por Correo electrónico: A practical O(n log(2 )n) time algorithm for computing the triplet distance on binary trees