An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees