For each element in a sequence of size $n$ there is exactly one exterior node in the merge-sort tree associated with it. Since the merge-sort tree is binary with exactly $n$ exterior nodes, we know it has height $\lceil \log n \rceil $.